7129 search results - page 199 / 1426 » Approximation Algorithms for Treewidth |
130
Voted
ALGORITHMICA
1999
15 years 3 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
121
Voted
DAC
1998
ACM
16 years 4 months ago
1998
ACM
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
137
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
146
click to vote
COLT
2010
Springer
15 years 1 months ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
124
click to vote
ICA
2007
Springer
15 years 10 months ago
2007
Springer
This paper introduces an extension of an earlier method of the author for separating stationary sources, based on the joint approximated diagonalization of interspectral matrices, ...