1538 search results - page 251 / 308 » Spectral Techniques in Graph Algorithms |
130
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
109
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
219
click to vote
GIS
2006
ACM
16 years 2 months ago
2006
ACM
The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs <p, q>, p R, q S such that the distance of an object ...
KDD
2006
ACM
16 years 1 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...
127
click to vote
ICSE
2004
IEEE-ACM
16 years 1 months ago
2004
IEEE-ACM
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...