58 search results - page 9 / 12 » Which Triangulations Approximate the Complete Graph |
115
click to vote
ENTCS
2007
15 years 17 days ago
2007
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
97
Voted
EACL
2006
ACL Anthology
15 years 2 months ago
2006
ACL Anthology
We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...
105
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
103
Voted
STOC
2007
ACM
16 years 28 days ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
101
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...