921 search results - page 69 / 185 » New Data Structures for Orthogonal Range Searching |
139
click to vote
WWW
2005
ACM
16 years 4 months ago
2005
ACM
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
117
click to vote
WWW
2002
ACM
16 years 4 months ago
2002
ACM
A large fraction of the useful web comprises of specification documents that largely consist of hattribute name, numeric valuei pairs embedded in text. Examples include product in...
136
click to vote
IJAR
2010
15 years 2 months ago
2010
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...
145
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We address the problem of unsupervised segmentation and grouping in 2D and 3D space, where samples are corrupted by noise, and in the presence of outliers. The problem has attract...
156
click to vote
VMV
2001
15 years 5 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...