2252 search results - page 422 / 451 » Lower Bounds for Dynamic Algorithms |
140
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
141
Voted
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
126
Voted
SIGSOFT
2004
ACM
16 years 3 months ago
2004
ACM
Constructing comprehensive operational models of intended system behaviour is a complex and costly task. Consequently, practitioners have adopted techniques that support increment...
150
Voted
SIGSOFT
2003
ACM
16 years 3 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
130
Voted
PODS
2008
ACM
16 years 2 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...