11565 search results - page 149 / 2313 » Computing Minimal Mappings |
121
click to vote
TCS
2011
14 years 11 months ago
2011
Using a combinatorial characterization of digital convexity based on words, one defines the language of convex words. The complement of this language forms an ideal whose minimal...
127
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
This paper addresses the problem of video inpainting, that is seamlessly reconstructing missing portions in a set of video frames. We propose to solve this problem proceeding as f...
160
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
143
click to vote
CVPR
2009
IEEE
15 years 11 months ago
2009
IEEE
Landmark labeling of training images is essential for many learning tasks in computer vision, such as object detection, tracking, and alignment. Image labeling is typically conduc...
149
click to vote
PPOPP
2006
ACM
15 years 10 months ago
2006
ACM
Recently, the high-performance computing community has realized that power is a performance-limiting factor. One reason for this is that supercomputing centers have limited power ...