2498 search results - page 247 / 500 » Data Structures with Unpredictable Timing |
167
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
102
click to vote
CSDA
2008
15 years 2 months ago
2008
This paper gives algorithms for determining real-valued univariate unimodal regressions, that is, for determining the optimal regression which is increasing and then decreasing. S...
126
Voted
SIGMOD
2002
ACM
16 years 2 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
127
Voted
WABI
2001
Springer
15 years 7 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
134
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...