1968 search results - page 264 / 394 » The Complexity of Valued Constraint Models |
RSA
2010
14 years 8 months ago
2010
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
105
click to vote
JCDL
2003
ACM
15 years 3 months ago
2003
ACM
The increasing power of techniques to model complex geometry and extract meaning from 3D information create complex data that must be described, stored, and displayed to be useful...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper, we present a new beamforming scheme for a downlink of multiuser multiple-input multipleoutput (MIMO) communication systems. Recently, a blockdiagonalization (BD)...
PAMI
2008
14 years 10 months ago
2008
In previous optimization-based methods of 3D planar-faced object reconstruction from single 2D line drawings, the missing depths of the vertices of a line drawing (and other parame...
108
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...