23 search results - page 1 / 5 » Experimental Study of Geometric t-Spanners: A Running Time C... |
WEA
2007
Springer
13 years 11 months ago
2007
Springer
HVC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper studies the efficiency of several probabilistic model checkers by comparing verification times and peak memory usage for a set of standard case studies. The s...
ESIAT
2009
IEEE
13 years 2 months ago
2009
IEEE
Shortcut nitrification was reported to be technically feasible and economically favourable, especially when sewages with high ammonium concentrations or low C/N ratios are treated....
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
ECCV
2002
Springer
14 years 6 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...