2498 search results - page 224 / 500 » Data Structures with Unpredictable Timing |
110
click to vote
STOC
2001
ACM
16 years 2 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
120
Voted
CLEF
2007
Springer
15 years 8 months ago
2007
Springer
The Image Distortion Model (IDM) has shown good retrieval quality in previous runs of the medical automatic annotation task of previous ImageCLEF workshops. However, one of its li...
111
click to vote
ISW
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We introduce the notion of persistent authenticated dictionaries, that is, dictionaries where the user can make queries of the type “was element e in set S at time t?â€...
DSRT
1998
IEEE
15 years 6 months ago
1998
IEEE
Internet-based virtual environments (VEs) let users explore multiple virtual worlds with many different geometric models which are downloaded rather than predistributed. To avoid ...
119
Voted
FCT
1995
Springer
15 years 6 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...