Sciweavers

10156 search results - page 1942 / 2032
» Step by Step to Histories
Sort
View
IIE
2007
75views more  IIE 2007»
14 years 11 months ago
Program and Evaluation Planning Light: Planning in the Real World
Although there are many high-quality models for program and evaluation planning, these models are often too intensive to be used in situations when time and resources are scarce. A...
Justus J. Randolph, Pasi J. Eronen
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
14 years 11 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
SIAMIS
2008
174views more  SIAMIS 2008»
14 years 11 months ago
Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
We consider the restoration of piecewise constant images where the number of the regions and their values are not fixed in advance, with a good difference of piecewise constant val...
Mila Nikolova, Michael K. Ng, Shuqin Zhang, Wai-Ki...
IJAR
2007
96views more  IJAR 2007»
14 years 11 months ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang
SIAMJO
2008
117views more  SIAMJO 2008»
14 years 11 months ago
Two Algorithms for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
E. Alper Yildirim
« Prev « First page 1942 / 2032 Last » Next »