7150 search results - page 423 / 1430 » An Approximation Algorithm for Approximation Rank |
195
click to vote
COCO
2007
Springer
16 years 1 months ago
2007
Springer
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a...
182
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
160
click to vote
ESANN
2007
15 years 8 months ago
2007
Abstract. The convex optimisation problem involved in fitting a kernel probit regression (KPR) model can be solved efficiently via an iteratively re-weighted least-squares (IRWLS)...
211
click to vote
COMPGEOM
2004
ACM
16 years 8 days ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
181
click to vote
LATIN
2004
Springer
16 years 6 days ago
2004
Springer
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...