13 search results - page 2 / 3 » Monotonicity of Non-deterministic Graph Searching |
ALENEX
2009
13 years 7 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
FOCS
2007
IEEE
14 years 3 days ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
WG
2009
Springer
14 years 11 days ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
ICPR
2006
IEEE
14 years 6 months ago
2006
IEEE
In this work we propose a probabilistic model for generic object classification from raw range images. Our approach supports a validation process in which classes are verified usi...