Sciweavers

44 search results - page 1 / 9
» Conquering Complexity
Sort
View
COMPUTER
2007
80views more  COMPUTER 2007»
13 years 8 months ago
Conquering Complexity
Gerard J. Holzmann
ICCV
2007
IEEE
14 years 10 months ago
A Divide-and-Conquer Approach to 3D Object Reconstruction from Line Drawings
3D object reconstruction from a single 2D line drawing is an important problem in both computer vision and graphics. Many methods have been put forward to solve this problem, but ...
Yu Chen, Jianzhuang Liu, Xiaoou Tang
RSS
2007
128views Robotics» more  RSS 2007»
13 years 10 months ago
Data Association in O(n) for Divide and Conquer SLAM
—In this paper we show that all processes associated to the move-sense-update cycle of EKF SLAM can be carried out in time linear in the number of map features. We describe Divid...
Lina María Paz, José E. Guivant, Jua...
KDD
2009
ACM
175views Data Mining» more  KDD 2009»
14 years 1 months ago
Multi-class protein fold recognition using large margin logic based divide and conquer learning
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
Huma Lodhi, Stephen Muggleton, Michael J. E. Stern...
CEC
2008
IEEE
14 years 3 months ago
Divide and conquer evolutionary TSP solution for vehicle path planning
— The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with...
Ryan J. Meuth, Donald C. Wunsch