Sciweavers

1088 search results - page 185 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
15 years 5 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
IROS
2007
IEEE
179views Robotics» more  IROS 2007»
15 years 5 months ago
Stereo-based 6D object localization for grasping with humanoid robot systems
Abstract— Robust vision-based grasping is still a hard problem for humanoid robot systems. When being restricted to using the camera system built-in into the robot’s head for o...
Pedram Azad, Tamim Asfour, Rüdiger Dillmann
ADAPTIVE
2007
Springer
15 years 5 months ago
Adaptive Focused Crawling
The large amount of available information on the Web makes it hard for users to locate resources about particular topics of interest. Traditional search tools, e.g., search engines...
Alessandro Micarelli, Fabio Gasparetti
MM
2006
ACM
145views Multimedia» more  MM 2006»
15 years 5 months ago
Interactive mosaic generation for video navigation
Navigation through large multimedia collections that include videos and images still remains a hard problem. In this paper, we introduce a novel method to visualize and navigate t...
Kihwan Kim, Irfan A. Essa, Gregory D. Abowd
RTCSA
2003
IEEE
15 years 4 months ago
Deterministic and Statistical Deadline Guarantees for a Mixed Set of Periodic and Aperiodic Tasks
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource r...
Minsoo Ryu, Seongsoo Hong