4480 search results - page 470 / 896 » Prototyping Completion with Constraints Using Computational ... |
207
click to vote
VC
2011
15 years 1 months ago
2011
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
267
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
155
click to vote
MM
2005
ACM
16 years 10 days ago
2005
ACM
Post-Bit is a small e-paper device modeled after paper PostIts r 1 . We explored and designed interfaces to handle multimedia contents with paper-like manipulations using this epa...
173
click to vote
PAMI
2006
15 years 6 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
177
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...