5356 search results - page 284 / 1072 » Adventures in time and space |
160
click to vote
AAAI
1996
15 years 8 months ago
1996
One of the most promising opportunities introduced by rapid advances in knowledge-based learning environments and multimedia technologies is the possibility of creating animated p...
174
click to vote
IM
2007
15 years 6 months ago
2007
Today’s search engines are increasingly required to broaden their capabilities beyond free-text search. More complex features, such as supporting range constraints over numeric ...
172
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
189
click to vote
ICALP
2004
Springer
16 years 2 days ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
159
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...