1404 search results - page 197 / 281 » Optimization problems in multiple-interval graphs |
100
click to vote
DCOSS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
SIROCCO
2004
14 years 11 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct te...
102
click to vote
STOC
2010
ACM
15 years 2 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...