2600 search results - page 7 / 520 » Clustering with or without the Approximation |
126
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
135
click to vote
HIPC
2007
Springer
15 years 5 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
103
click to vote
EACL
2009
ACL Anthology
16 years 1 months ago
2009
ACL Anthology
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
FOSSACS
2007
Springer
15 years 7 months ago
2007
Springer
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue ...
CC
1999
Springer
15 years 28 days ago
1999
Springer
