1921 search results - page 128 / 385 » Stereo Without Search |
132
click to vote
SPIRE
1998
Springer
15 years 8 months ago
1998
Springer
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
130
Voted
CCS
2000
ACM
15 years 7 months ago
2000
ACM
This paper initiates a study of accountable certificate management methods, necessary to support long-term authenticity of digital documents. Our main contribution is a model for ...
167
Voted
AUSAI
2008
Springer
15 years 6 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
155
Voted
FLAIRS
2004
15 years 5 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
114
click to vote
UAI
2001
15 years 5 months ago
2001
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...