Sciweavers

3341 search results - page 54 / 669
» On Bounded Queries and Approximation
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
14 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
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
15 years 11 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
ADC
2008
Springer
112views Database» more  ADC 2008»
15 years 4 months ago
Semantics based Buffer Reduction for Queries over XML Data Streams
With respect to current methods for query evaluation over XML data streams, adoption of certain types of buffering techniques is unavoidable. Under lots of circumstances, the buff...
Chi Yang, Chengfei Liu, Jianxin Li, Jeffrey Xu Yu,...
DASFAA
2008
IEEE
116views Database» more  DASFAA 2008»
14 years 11 months ago
MBR Models for Uncertainty Regions of Moving Objects
The increase in the advanced location based services such as traffic coordination and management necessitates the need for advanced models tracking the positions of Moving Objects ...
Shayma Alkobaisi, Wan D. Bae, Seon Ho Kim, Byunggu...
MOC
2002
72views more  MOC 2002»
14 years 9 months ago
Long-term stability of variable stepsize approximations of semigroups
This paper is concerned with the stability of rational one-step approximations of C0 semigroups. Particular emphasis is laid on long-term stability bounds. The analysis is based on...
Nikolai Bakaev, Alexander Ostermann