301 search results - page 17 / 61 » The k-Median Problem for Directed Trees |
95
Voted
CP
2010
Springer
14 years 7 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
101
click to vote
AINA
2007
IEEE
15 years 3 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
70
Voted
SODA
2010
ACM
15 years 6 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
78
Voted
ESA
1998
Springer
15 years 1 months ago
1998
Springer
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
ICML
2004
IEEE
15 years 2 months ago
2004
IEEE
Nested dichotomies are a standard statistical technique for tackling certain polytomous classification problems with logistic regression. They can be represented as binary trees ...