Sciweavers

11151 search results - page 173 / 2231
» On the Complexity of Model Expansion
Sort
View
MP
2006
101views more  MP 2006»
15 years 7 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie
SWAT
1998
Springer
84views Algorithms» more  SWAT 1998»
15 years 11 months ago
Models and Motion Planning
We study the complexity of the motion planning problem for a bounded-reach robot in the situation where the n obstacles in its workspace satisfy two of the realistic models propos...
Mark de Berg, Matthew J. Katz, Mark H. Overmars, A...
162
Voted
FOCS
2005
IEEE
16 years 19 days ago
On the Complexity of Real Functions
We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the Computable Analysis approach. We then use...
Mark Braverman
154
Voted
ICASSP
2011
IEEE
14 years 10 months ago
Augmented complex matrix factorisation
A novel framework for the factorisation of complex-valued data is derived using recent developments in complex statistics. Unlike existing factorisation tools the algorithms can c...
David Looney, Danilo P. Mandic
ISBI
2002
IEEE
16 years 7 months ago
Deformable m-rep segmentation of object complexes
While we have previously reported on multiscale segmentation of single-figure anatomic objects from medical images by deformable m-rep models, here we report on a method of segmen...
P. Thomas Fletcher, Stephen M. Pizer, A. Graham Ga...