Sciweavers

6274 search results - page 8 / 1255
» From query complexity to computational complexity
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 11 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
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 10 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
VISUALIZATION
2003
IEEE
14 years 3 months ago
Interactive View-Dependent Rendering with Conservative Occlusion Culling in Complex Environments
This paper presents a novel algorithm combining view-dependent rendering and conservative occlusion culling for interactive display of complex environments. A vertex hierarchy of ...
Sung-Eui Yoon, Brian Salomon, Dinesh Manocha
VLDB
2001
ACM
92views Database» more  VLDB 2001»
14 years 2 months ago
Fast Evaluation Techniques for Complex Similarity Queries
Complex similarity queries, i.e., multi-feature multi-object queries, are needed to express the information need of a user against a large multimedia repository. Even if a user in...
Klemens Böhm, Michael Mlivoncic, Hans-Jö...