157 search results - page 10 / 32 » Randomized Algorithms for Minimum Distance Localization |
SIAMCOMP
2010
13 years 6 months ago
2010
We propose a general model of local property reconstruction. Suppose we have a function f on domain Γ, which is supposed to have a particular property P, but may not have the pro...
UAI
2003
13 years 9 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
ROBIO
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— We present a strategy for resolving multiple hypotheses of a robot’s state during global localization. The strategy operates in two stages. In the first stage a uniq...