2168 search results - page 208 / 434 » Randomized Algorithms and Complexity Theory |
143
Voted
MCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
148
Voted
SAC
2008
ACM
15 years 3 months ago
2008
ACM
A number of techniques for generating geometric models of human head and body are in use nowadays. Models of human characters are useful in computer games, virtual reality, and ma...
185
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
152
Voted
ICIP
2009
IEEE
15 years 1 months ago
2009
IEEE
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
232
Voted
GIS
2006
ACM
16 years 4 months ago
2006
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...