2969 search results - page 168 / 594 » A space efficient algorithm for group structure computation |
142
Voted
TOG
2008
15 years 3 months ago
2008
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
113
Voted
PAMI
2008
15 years 3 months ago
2008
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
140
Voted
TMM
2008
15 years 3 months ago
2008
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis p...
134
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
122
Voted
ESA
2010
Springer
15 years 4 months ago
2010
Springer
We define the robustness of a level set homology class of a function f : X R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theor...