4850 search results - page 233 / 970 » Approximate Data Structures with Applications |
166
click to vote
FOCS
2006
IEEE
16 years 16 days ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
187
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
The world today is characterised by the proliferation of information sources available through media such as the WWW, databases, semi-structured files (e.g. XML documents), etc. N...
175
click to vote
VLDB
1999
ACM
15 years 10 months ago
1999
ACM
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
166
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
254
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...