Sciweavers

220 search results - page 39 / 44
» The Forgiving Tree: A Self-Healing Distributed Data Structur...
Sort
View
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
13 years 11 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
ICDE
2003
IEEE
247views Database» more  ICDE 2003»
14 years 9 months ago
CLUSEQ: Efficient and Effective Sequence Clustering
Analyzing sequence data has become increasingly important recently in the area of biological sequences, text documents, web access logs, etc. In this paper, we investigate the pro...
Jiong Yang, Wei Wang 0010
ICC
2007
IEEE
113views Communications» more  ICC 2007»
14 years 1 months ago
Utility-Aware Resource Allocation for Multi-Stream Overlay Multicast
Abstract - Overlay multicast, which performs topology construction and data relaying in the application layer, has recently emerged as a promising vehicle for data distribution. In...
Ji Xu, Jiangchuan Liu, Hsiao-Hwa Chen, Xiao Chu
VRST
2003
ACM
14 years 26 days ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
ICCS
2007
Springer
14 years 1 months ago
Searching and Updating Metric Space Databases Using the Parallel EGNAT
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
Mauricio Marín, Roberto Uribe, Ricardo J. B...