1024 search results - page 104 / 205 » The Generalized PatchMatch Correspondence Algorithm |
120
click to vote
SIGECOM
2011
ACM
14 years 23 days ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
CVPR
2012
IEEE
13 years 11 days ago
2012
IEEE
In this paper, we propose a bilevel sparse coding model for coupled feature spaces, where we aim to learn dictionaries for sparse modeling in both spaces while enforcing some desi...
109
click to vote
LOGCOM
1998
14 years 9 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
PAMI
2007
14 years 9 months ago
2007
We present a new approach to camera calibration as a part of a complete and practical system to recover digital copies of sculpture from uncalibrated image sequences taken under t...
ICS
2010
Tsinghua U.
15 years 2 months ago
2010
Tsinghua U.
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...