6251 search results - page 980 / 1251 » Randomness, Computability, and Density |
211
click to vote
AI
2003
Springer
16 years 15 days ago
2003
Springer
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
183
click to vote
ISAAC
2003
Springer
16 years 14 days ago
2003
Springer
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
212
click to vote
DSN
2002
IEEE
16 years 7 days ago
2002
IEEE
This paper describes a Secure INtrusion-Tolerant Replication Architecture1 (SINTRA) for coordination in asynchronous networks subject to Byzantine faults. SINTRA supplies a number...
222
click to vote
FOCS
2002
IEEE
16 years 7 days ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
178
click to vote
FOCS
2002
IEEE
16 years 7 days ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...