7129 search results - page 210 / 1426 » Approximation Algorithms for Treewidth |
266
click to vote
IACR
2011
14 years 3 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
123
click to vote
EURONGI
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
135
click to vote
IJCAI
2007
15 years 5 months ago
2007
In recent years, metric learning in the semisupervised setting has aroused a lot of research interests. One type of semi-supervised metric learning utilizes supervisory informatio...
134
click to vote
ALGORITHMICA
2005
15 years 3 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
123
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...