Sciweavers

197 search results - page 6 / 40
» Complexity of Max-SAT using stochastic algorithms
Sort
View
ATAL
2008
Springer
14 years 11 months ago
An approach to online optimization of heuristic coordination algorithms
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
Jumpol Polvichai, Paul Scerri, Michael Lewis
ITCC
2003
IEEE
15 years 2 months ago
Stochastic Image Compression Using Fractals
Fractal objects like Sierpinski triangle and Fern have very high visual complexity and low storage-information content. For generating computer graphic images and compression of s...
Aditya Kapoor, Kush Arora, Ajai Jain, G. P. Kapoor
MP
2006
87views more  MP 2006»
14 years 9 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed
PRIS
2001
14 years 11 months ago
Improving the Robustness of Parametric Shape Tracking with Switched Multiple Models
This paper addresses the problem of tracking objects with complex motion dynamics or shape changes. It is assumed that some of the visual features detected in the image (e.g., edg...
Jacinto C. Nascimento, Jorge S. Marques
ICPR
2010
IEEE
14 years 12 months ago
Fast Training of Object Detection Using Stochastic Gradient Descent
Training datasets for object detection problems are typically very large and Support Vector Machine (SVM) implementations are computationally complex. As opposed to these complex ...
Rob Wijnhoven, Peter H. N. De With