7129 search results - page 221 / 1426 » Approximation Algorithms for Treewidth |
129
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping...
111
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
154
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
115
click to vote
CMMR
2003
Springer
15 years 9 months ago
2003
Springer
In the context of musical analysis, we propose an algorithm that automatically induces patterns from polyphonies. We define patterns as “perceptible repetitions in a musical piec...
132
click to vote
ECCC
2000
15 years 3 months ago
2000
We design a 0:795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio ...