119 search results - page 2 / 24 » A relaxed approach to combinatorial problems in robustness a... |
JSAT
2006
13 years 5 months ago
2006
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
IOR
2011
13 years 6 days ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
3DPVT
2006
IEEE
13 years 11 months ago
2006
IEEE
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
Finding the least squares (LS) solution s to a system of linear equations Hs = y where H, y are given and s is a vector of binary variables, is a well known NP-hard problem. In th...