4865 search results - page 479 / 973 » The Complexity of Graph Connectivity |
205
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
186
click to vote
EMNLP
2009
15 years 4 months ago
2009
We present an inexact search algorithm for the problem of predicting a two-layered dependency graph. The algorithm is based on a k-best version of the standard cubictime search al...
146
click to vote
ICCV
2007
IEEE
16 years 9 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...
173
Voted
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
The availability of large-scale protein-protein interaction data provides us with many opportunities to study molecular pathways involving proteins. In this paper we propose to mi...
190
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...