Sciweavers

778 search results - page 6 / 156
» Bounding Smooth Integers
Sort
View
21
Voted
SOFSEM
2007
Springer
14 years 1 months ago
A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
Dominique Quadri, Éric Soutif, Pierre Tolla
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 7 months ago
Tight Bounds for Blind Search on the Integers
We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wege...
CORR
2008
Springer
158views Education» more  CORR 2008»
13 years 7 months ago
Improved Smoothed Analysis of the k-Means Method
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
Bodo Manthey, Heiko Röglin
DCC
2007
IEEE
14 years 7 months ago
Lossless and Near-Lossless Audio Compression Using Integer-Reversible Modulated Lapped Transforms
We present a simple lossless audio codec, composed of an integer-reversible modulated lapped transform (MLT) followed by a backward-adaptive run-length/Golomb-Rice (RLGR) encoder....
Henrique S. Malvar