692 search results - page 59 / 139 » BDD minimization for approximate computing |
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
ICPR
2000
IEEE
16 years 1 days ago
2000
IEEE
This paper proposes a method for face reconstruction that makes use of only a small set of feature points. Faces can be modeled by forming linear combinations of prototypes of sha...
CVPR
2004
IEEE
16 years 29 days ago
2004
IEEE
The Gaussian kernel has played a central role in multi-scale methods for feature extraction and matching. In this paper, a method for shaping the filter using the local image stru...
STACS
2009
Springer
15 years 5 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
116
click to vote
ICALP
2004
Springer
15 years 4 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...