279 search results - page 26 / 56 » Reduction approaches for robust shortest path problems |
107
click to vote
ACCV
2006
Springer
15 years 5 months ago
2006
Springer
Background subtraction is an essential task in several static camera based computer vision systems. Background modeling is often challenged by spatio-temporal changes occurring due...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract-- Variable length codes (VLCs) exhibit desynchronization problems when transmitted over noisy channels. Trellis decoding techniques based on Maximum A Posteriori (MAP) est...
ICDE
2011
IEEE
14 years 3 months ago
2011
IEEE
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
GLVLSI
2009
IEEE
15 years 6 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
ALGORITHMICA
2005
14 years 11 months ago
2005
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...