144 search results - page 13 / 29 » Improved Approximation Guarantees for Sublinear-Time Fourier... |
LATIN
2004
Springer
14 years 23 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...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
APPROX
2000
Springer
13 years 11 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
CISC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...