736 search results - page 41 / 148 » A dynamic data structure for approximate range searching |
SCIA
2009
Springer
14 years 3 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
We propose a method of classifying XML documents and extracting XML schema from XML by inductive inference based on constraint logic programming. The goal of this work is to type ...
EUROSYS
2006
ACM
14 years 6 months ago
2006
ACM
Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are in...
GIR
2006
ACM
14 years 2 months ago
2006
ACM
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
SIGMOD
2002
ACM
14 years 9 months ago
2002
ACM
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...