3415 search results - page 543 / 683 » Lower Bounds for Kernelizations |
100
click to vote
ISRR
2005
Springer
15 years 10 months ago
2005
Springer
We are concerned here with improving long range stereo by filtering image sequences. Traditionally, measurement errors from stereo camera systems have been approximated as 3-D Gau...
131
click to vote
IWQOS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Network operators would like their network to support current and future traffic matrices, even when links and routers fail. Not surprisingly, no backbone network can do ...
128
click to vote
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
137
click to vote
MICAI
2005
Springer
15 years 10 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
134
click to vote
PDCAT
2005
Springer
15 years 10 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...