165 search results - page 13 / 33 » Computing hereditary convex structures |
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
TCS
2011
13 years 2 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...
CCCG
1993
13 years 9 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
In geometric computer vision, the structure from motion (SfM) problem can be formulated as a optimization problem with a rank constraint. It is well known that the trace norm of a...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...