2796 search results - page 267 / 560 » The coolest path problem |
153
click to vote
ICRA
1994
IEEE
15 years 10 months ago
1994
IEEE
There is a close relationship between harmonic functions { which have recently been proposed for path planning { and hitting probabilities for random processes. The hitting probab...
182
click to vote
ICDT
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
169
click to vote
ENTCS
2007
15 years 6 months ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
188
click to vote
SIAMDM
2008
15 years 6 months ago
2008
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dom...
170
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper explores a novel setting for compressed sensing (CS) in which the sampling trajectory length is a critical bottleneck and must be minimized subject to constraints on th...