86 search results - page 6 / 18 » soda 2004 |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We show that the point containment problem in the integer hull of a polyhedron, which is defined by m inequalities, with coefficients of at most bits can be solved in time O(m + ...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
In this paper, we extend Rothemund and Winfree's examination of the tile complexity of tile self-assembly [6]. They provided a lower bound of ( log N log log N ) on the tile ...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing method...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
Simulated tempering and swapping are two families of sampling algorithms in which a parameter representing temperature varies during the simulation. The hope is that this will ove...