Sciweavers

778 search results - page 29 / 156
» Bounding Smooth Integers
Sort
View
ANOR
2005
131views more  ANOR 2005»
13 years 7 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas
SASO
2008
IEEE
14 years 2 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau
EJC
2007
13 years 7 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
ICIP
2001
IEEE
14 years 9 months ago
On the compression of two-dimensional piecewise smooth functions
It is well known that wavelets provide good non-linear approximation of one-dimensional (1-D) piecewise smooth functions. However, it has been shown that the use of a basis with g...
Pier Luigi Dragotti, Minh N. Do, Rahul Shukla, Mar...
MP
2011
13 years 2 months ago
Smoothed analysis of condition numbers and complexity implications for linear programming
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
John Dunagan, Daniel A. Spielman, Shang-Hua Teng