559 search results - page 65 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
ECML
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, dimensionality reduction via matrix factorization with nonnegativity constraints is studied. Because of these constraints, it stands apart from other linea...
ICDE
2010
IEEE
13 years 8 months ago
2010
IEEE
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
TCAD
1998
13 years 7 months ago
1998
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
CPC
2000
13 years 7 months ago
2000
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...