3678 search results - page 561 / 736 » On the Stable Paths Problem |
139
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
154
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
116
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
133
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
274
click to vote
ICCV
1999
IEEE
16 years 6 months ago
1999
IEEE
In this paper we address the problem of estimating and analyzing the motion in image sequences that involve fluid phenomena. In this context standard motion estimation techniques ...