1431 search results - page 172 / 287 » The complexity of random ordered structures |
172
click to vote
ESA
2007
Springer
15 years 9 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...
138
Voted
PET
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network ...
135
click to vote
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
We develop a method for learning the spatial statistics of optical flow fields from a novel training database. Training flow fields are constructed using range images of natur...
137
click to vote
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
138
click to vote
SIGMOD
2004
ACM
15 years 8 months ago
2004
ACM
Data items are often associated with a location in which they are present or collected, and their relevance or in uence decays with their distance. Aggregate values over such data...