2109 search results - page 211 / 422 » Solving Necklace Constraint Problems |
174
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
145
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
185
Voted
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
125
click to vote
ICASSP
2008
IEEE
16 years 21 days ago
2008
IEEE
In this paper, we apply the primal-dual decomposition and subgradient projection methods to solve the rate-distortion optimization problem with the constant bit rate constraint. T...
153
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
- Redundant via insertion is a good solution to reduce the yield loss by via failure. However, the existing methods are all post-layout optimizations that insert redundant via afte...