1091 search results - page 37 / 219 » Approximation in Databases |
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
SIGMOD
2005
ACM
14 years 8 months ago
2005
ACM
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
SIGMOD
2003
ACM
14 years 8 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
DASFAA
2010
IEEE
14 years 25 days ago
2010
IEEE
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...