Sciweavers

989 search results - page 74 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
ICCV
1999
IEEE
14 years 9 months ago
Curve Finder Combining Perceptual Grouping and a Kalman Like Fitting
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
Frederic Guichard, Jean-Philippe Tarel
ACCV
2006
Springer
14 years 1 months ago
Super Resolution Using Graph-Cut
Abstract. This paper addresses the problem of super resolution - obtaining a single high-resolution image given a set of low resolution images which are related by small displaceme...
Uma Mudenagudi, Ram Singla, Prem Kumar Kalra, Subh...
ICCAD
2006
IEEE
141views Hardware» more  ICCAD 2006»
14 years 4 months ago
Algorithms for MIS vector generation and pruning
Ignoring the effect of simultaneous switching for logic gates causes silicon failures for high performance microprocessor designs. The main reason to omit this effect is the run...
Kenneth S. Stevens, Florentin Dartu
GECCO
2009
Springer
145views Optimization» more  GECCO 2009»
14 years 17 days ago
Investigating and exploiting the bias of the weighted hypervolume to articulate user preferences
Optimizing the hypervolume indicator within evolutionary multiobjective optimizers has become popular in the last years. Recently, the indicator has been generalized to the weight...
Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart...
TCS
2008
13 years 7 months ago
Finding a minimum medial axis of a discrete shape is NP-hard
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
David Coeurjolly, Jérôme Hulin, Isabe...