Sciweavers

8298 search results - page 248 / 1660
» On the Complexity of Numerical Analysis
Sort
View
ICRA
2005
IEEE
134views Robotics» more  ICRA 2005»
16 years 25 days ago
Reachability Analysis of Sampling Based Planners
— The last decade, sampling based planners like the Probabilistic Roadmap Method have proved to be successful in solving complex motion planning problems. We give a reachability ...
Roland Geraerts, Mark H. Overmars
JC
2006
139views more  JC 2006»
15 years 7 months ago
The basic feasible functionals in computable analysis
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
Branimir Lambov
ICDE
2002
IEEE
146views Database» more  ICDE 2002»
16 years 8 months ago
Streaming-Data Algorithms for High-Quality Clustering
Streaming data analysis has recently attracted attention in numerous applications including telephone records, web documents and clickstreams. For such analysis, single-pass algor...
Liadan O'Callaghan, Adam Meyerson, Rajeev Motwani,...
SSIAI
2002
IEEE
16 years 4 days ago
Spatio-Temporal Motion Segmentation via Level Set Partial Differential Equations
Motion-based segmentation of image sequences is an important problem of image analysis, with numerous applications to image coding and image manipulation. We present a novel algor...
Abdol-Reza Mansouri, Amar Mitiche, Rosario El-Fegh...
NIPS
2001
15 years 8 months ago
On the Convergence of Leveraging
We give an unified convergence analysis of ensemble learning methods including e.g. AdaBoost, Logistic Regression and the Least-SquareBoost algorithm for regression. These methods...
Gunnar Rätsch, Sebastian Mika, Manfred K. War...