2137 search results - page 362 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
119
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
139
click to vote
WEA
2010
Springer
15 years 9 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
138
Voted
ICML
2004
IEEE
16 years 3 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
100
Voted
KDD
2006
ACM
16 years 2 months ago
2006
ACM
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
159
click to vote
COMPGEOM
2001
ACM
15 years 6 months ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...