8 search results - page 1 / 2 » Optimizing the topological and combinatorial complexity of i... |
105
Voted
CAD
2005
Springer
15 years 9 days ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
107
click to vote
BMCBI
2010
15 years 16 days ago
2010
Background: High-throughput methods for detecting protein-protein interactions enable us to obtain large interaction networks, and also allow us to computationally identify the as...
134
Voted
KDD
2009
ACM
16 years 29 days ago
2009
ACM
: ? Improving Clustering Stability with Combinatorial MRFs Bekkerman, Ron; Scholz, Martin; Viswanathan, Krishnamurthy HP Laboratories HPL-2009-46 Clustering stability, combinatoria...
89
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
We introduce a novel topological formulation for contour grouping. Our grouping criterion, called untangling cycles, exploits the inherent topological 1D structure of salient cont...
95
Voted
CORR
2002
Springer
15 years 7 days ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...