2612 search results - page 245 / 523 » Switching Graphs and Their Complexity |
187
click to vote
SODA
2000
ACM
15 years 7 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...
181
click to vote
DAM
2002
15 years 5 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
160
click to vote
EMNLP
2009
15 years 3 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...
134
click to vote
ICCV
2007
IEEE
16 years 7 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...
141
click to vote
RECOMB
2004
Springer
16 years 6 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...