7129 search results - page 241 / 1426 » Approximation Algorithms for Treewidth |
154
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
226
click to vote
SDM
2012
SIAM
13 years 6 months ago
2012
SIAM
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
131
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
134
click to vote
COLOGNETWENTE
2008
15 years 5 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
126
click to vote
SIAMCOMP
2010
14 years 10 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...