2498 search results - page 320 / 500 » Data Structures with Unpredictable Timing |
162
Voted
SODA
2000
ACM
15 years 7 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
223
click to vote
IJCAI
1989
15 years 7 months ago
1989
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
155
click to vote
TRECVID
2007
15 years 7 months ago
2007
For the first time in 2007, TRECVID considered structured evaluation of automated video summarization, utilizing BBC rushes video. This paper discusses in detail our approaches fo...
182
click to vote
DM
2006
15 years 6 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
145
click to vote
IJRR
2008
15 years 6 months ago
2008
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...