3640 search results - page 452 / 728 » The Geometry of Web Search |
152
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
176
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
174
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
Multiresolution analysis has been proposed as a basic tool supporting compression, progressive transmission, and level-of-detail control of complex meshes in a unified and theoret...
193
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
161
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Despite the success of web search engines, search over large enterprise intranets still suffers from poor result quality. Earlier work [6] that compared intranets and the Internet...