4850 search results - page 420 / 970 » Approximate Data Structures with Applications |
162
click to vote
ICDT
2005
ACM
16 years 12 days ago
2005
ACM
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
205
click to vote
CVPR
2003
IEEE
16 years 9 months ago
2003
IEEE
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
236
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
205
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
Compared with traditional association rule mining in the structured world (e.g. Relational Databases), mining from XML data is confronted with more challenges due to the inherent ...
168
click to vote
IPPS
2006
IEEE
16 years 28 days ago
2006
IEEE
The development of efficient parallel out-of-core applications is often tedious, because of the need to explicitly manage the movement of data between files and data structures ...