413 search results - page 14 / 83 » Computing and Exploiting Tree-Decompositions for Solving Con... |
136
click to vote
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE
In this paper, we consider the problem of super-resolving a human face video by a very high (?16) zoom factor. Inspired by recent literature on hallucination and examplebased lear...
129
click to vote
PPSN
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
ICTAI
2008
IEEE
15 years 7 months ago
2008
IEEE
Control architectures, such as the LAAS architecture [1], CLARATY [12] and HARPIC [9], have been developped to provide autonomy to robots. To achieve a robot’s task, these contr...
CVPR
2006
IEEE
16 years 3 months ago
2006
IEEE
Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one...
201
click to vote
AGP
2010
IEEE
15 years 6 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...