2430 search results - page 253 / 486 » Computing Tutte Polynomials |
161
click to vote
JCAM
2011
14 years 7 months ago
2011
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
178
click to vote
SIAMMAX
2011
14 years 7 months ago
2011
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
120
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...
134
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
143
Voted
COCO
2004
Springer
15 years 7 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...