Sciweavers

1019 search results - page 40 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
14 years 2 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
HIS
2003
13 years 10 months ago
On the Performance of Ant-based Clustering
Ant-based clustering and sorting is a nature-inspired heuristic for general clustering tasks. It has been applied variously, from problems arising in commerce, to circuit design, t...
Julia Handl, Joshua D. Knowles, Marco Dorigo
MICCAI
2008
Springer
14 years 9 months ago
Segmenting Brain Tumors Using Pseudo-Conditional Random Fields
Locating Brain tumor segmentation within MR (magnetic resonance) images is integral to the treatment of brain cancer. This segmentation task requires classifying each voxel as eith...
Chi-Hoon Lee, Shaojun Wang, Albert Murtha, Matt...
ICPR
2010
IEEE
13 years 10 months ago
Compressing Sparse Feature Vectors Using Random Ortho-Projections
In this paper we investigate the usage of random ortho-projections in the compression of sparse feature vectors. The study is carried out by evaluating the compressed features in ...
Esa Rahtu, Mikko Salo, Janne Heikkilä
DCG
2008
93views more  DCG 2008»
13 years 8 months ago
Robust Shape Fitting via Peeling and Grating Coresets
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu