2638 search results - page 351 / 528 » Random Geometric Complexes |
145
Voted
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
150
Voted
SAC
2006
ACM
15 years 8 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
132
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
137
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
104
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Sparse representation in compressive sensing is gaining increasing attention due to its success in various applications. As we demonstrate in this paper, however, image sparse rep...