5100 search results - page 426 / 1020 » The Linear Complexity of a Graph |
222
Voted
DAM
2002
15 years 7 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...
203
Voted
EMNLP
2009
15 years 5 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...
210
Voted
INFOCOM
2005
IEEE
16 years 1 months ago
2005
IEEE
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
164
Voted
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...
184
Voted
RECOMB
2004
Springer
16 years 8 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...