Sciweavers

406 search results - page 28 / 82
» A Cost Model for Similarity Queries in Metric Spaces
Sort
View
COMGEO
2006
ACM
13 years 7 months ago
Octrees with near optimal cost for ray-shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applica...
Hervé Brönnimann, Marc Glisse
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 9 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
DEXA
2006
Springer
113views Database» more  DEXA 2006»
13 years 11 months ago
Dynamic Range Query in Spatial Network Environments
Moving range queries over mobile objects are important in many location management applications. There have been quite a few research works in this area. However, all existing solu...
Fuyu Liu, Tai T. Do, Kien A. Hua
SISAP
2009
IEEE
159views Data Mining» more  SISAP 2009»
14 years 2 months ago
Dynamic P2P Indexing and Search Based on Compact Clustering
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Mauricio Marín, Veronica Gil Costa, Cecilia...
BPM
2006
Springer
166views Business» more  BPM 2006»
13 years 11 months ago
Process Mining by Measuring Process Block Similarity
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
Joonsoo Bae, James Caverlee, Ling Liu, Hua Yan