Sciweavers

952 search results - page 101 / 191
» Computational complexity of stochastic programming problems
Sort
View
CRV
2008
IEEE
205views Robotics» more  CRV 2008»
15 years 9 months ago
Accurate Boundary Localization using Dynamic Programming on Snakes
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl...
HRI
2006
ACM
15 years 8 months ago
Developer oriented visualisation of a robot program
Robot programmers are faced with the challenging problem of understanding the robot’s view of its world, both when creating and when debugging robot software. As a result tools ...
T. H. J. Collett, B. A. MacDonald
EUROPAR
2010
Springer
15 years 4 months ago
cTrust: Trust Aggregation in Cyclic Mobile Ad Hoc Networks
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
Huanyu Zhao, Xin Yang, Xiaolin Li
AAAI
2004
15 years 4 months ago
SOFIA's Choice: An AI Approach to Scheduling Airborne Astronomy Observations
We describe an innovative solution to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The probl...
Jeremy Frank, Michael A. K. Gross, Elif Kürkl...
108
Voted
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 2 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont