224 search results - page 19 / 45 » G-graphs for the cage problem: a new upper bound |
143
Voted
ICASSP
2008
IEEE
16 years 16 days ago
2008
IEEE
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
156
click to vote
ACL
1990
15 years 7 months ago
1990
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...
158
click to vote
DCC
2006
IEEE
16 years 5 months ago
2006
IEEE
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
162
click to vote
ISPD
2003
ACM
15 years 11 months ago
2003
ACM
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
157
click to vote
FOCS
2006
IEEE
16 years 4 days ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...