255 search results - page 24 / 51 » A new upper bound for the bipartite Ramsey problem |
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...
164
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
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...
152
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...