Sciweavers

443 search results - page 60 / 89
» Analysis of Heuristics for Number Partitioning
Sort
View
ICCV
2003
IEEE
16 years 5 months ago
Mean Shift Based Clustering in High Dimensions: A Texture Classification Example
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
Bogdan Georgescu, Ilan Shimshoni, Peter Meer
129
Voted
COMPGEOM
2009
ACM
15 years 8 months ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
LCPC
2007
Springer
15 years 10 months ago
Multidimensional Blocking in UPC
Abstract. Partitioned Global Address Space (PGAS) languages offer an attractive, high-productivity programming model for programming large-scale parallel machines. PGAS languages, ...
Christopher Barton, Calin Cascaval, George Alm&aac...
TSP
2008
117views more  TSP 2008»
15 years 3 months ago
Sample Eigenvalue Based Detection of High-Dimensional Signals in White Noise Using Relatively Few Samples
The detection and estimation of signals in noisy, limited data is a problem of interest to many scientific and engineering communities. We present a mathematically justifiable, com...
R. R. Nadakuditi, A. Edelman
IS
2010
15 years 2 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley