Sciweavers

927 search results - page 89 / 186
» A Data Abstraction Alternative to Data Structure Algorithm M...
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 4 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
SIGIR
2004
ACM
15 years 8 months ago
Document clustering via adaptive subspace iteration
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
Tao Li, Sheng Ma, Mitsunori Ogihara
TMI
2010
155views more  TMI 2010»
14 years 9 months ago
Tubular Surface Segmentation for Extracting Anatomical Structures From Medical Imagery
Abstract--This work provides a model for tubular structures, and devises an algorithm to automatically extract tubular anatomical structures from medical imagery. Our model fits ma...
Vandana Mohan, Ganesh Sundaramoorthi, Allen Tannen...
127
Voted
FSKD
2005
Springer
101views Fuzzy Logic» more  FSKD 2005»
15 years 8 months ago
Geometrical Probability Covering Algorithm
Abstract. In this paper, we propose a novel classification algorithm, called geometrical probability covering (GPC) algorithm, to improve classification ability. On the basis of ...
Junping Zhang, Stan Z. Li, Jue Wang
121
Voted
FOCS
2006
IEEE
15 years 8 months ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee