6274 search results - page 246 / 1255 » From query complexity to computational complexity |
133
Voted
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
145
click to vote
Publication
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...
175
Voted
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
155
click to vote
CVPR
1999
IEEE
16 years 6 months ago
1999
IEEE
The image irradiance of a three-dimensional object is known to be the function of three components: the distribution of light sources, the shape, and reflectance of a real object ...
183
click to vote
ECCV
1994
Springer
16 years 6 months ago
1994
Springer
Abstract. This paper presents a new algorithm for structure from motion from an arbitrary number of tracked features over an arbitrary number of images, which possesses several adv...