Sciweavers

502 search results - page 7 / 101
» Monotone Approximation of Decision Problems
Sort
View
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
14 years 11 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
14 years 11 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...
ADCM
2007
104views more  ADCM 2007»
14 years 9 months ago
Shape preserving histogram approximation
We present a new method for reconstructing the density function underlying a given histogram. First we analyze the univariate case taking the approximating function in a class of q...
Paolo Costantini, Francesca Pelosi
INFOCOM
2005
IEEE
15 years 3 months ago
Monotone percolation and the topology control of wireless networks
— This paper addresses the topology control problem for large wireless networks that are modelled by an infinite point process on a two-dimensional plane. Topology control is th...
Anxiao Jiang, Jehoshua Bruck
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
14 years 11 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...