Sciweavers

1352 search results - page 108 / 271
» An algorithm for minimizing the Mumford-Shah functional
Sort
View
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 2 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
DATE
2003
IEEE
101views Hardware» more  DATE 2003»
15 years 4 months ago
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures
In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic rout...
Jingcao Hu, Radu Marculescu
COLT
1999
Springer
15 years 3 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
CVPR
2012
IEEE
13 years 1 months ago
Curvature-based regularization for surface approximation
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...
Carl Olsson, Yuri Boykov
CVPR
2012
IEEE
13 years 1 months ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould