329 search results - page 14 / 66 » New lower bounds for some spherical designs |
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
SPAA
1993
ACM
14 years 15 days ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
ICCAD
2000
IEEE
14 years 25 days ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
COCO
2009
Springer
14 years 3 months ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
ICAPR
2009
Springer
14 years 3 months ago
2009
Springer
Morphological operators designed for grey-scale functions process every points of the space identically whatever their luminance. In many situations however, it is interesting to ...