424 search results - page 82 / 85 » Realizability models and implicit complexity |
125
click to vote
IADIS
2004
15 years 2 months ago
2004
The accelerated development in grid computing has positioned it as a promising next generation computing platform. It enables the creation of virtual organizations (VO) for sharin...
118
click to vote
IJCAI
1989
15 years 2 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
101
click to vote
AAAI
2010
15 years 1 months ago
2010
Developing a robust, flexible, closed-loop walking algorithm for a humanoid robot is a challenging task due to the complex dynamics of the general biped walk. Common analytical ap...
115
click to vote
JMM2
2006
15 years 1 months ago
2006
Abstract-- In this paper, we present a clustering-based tracking algorithm for tracking people (e.g. hand, head, eyeball, body, and lips). It is always a challenging task to track ...
128
click to vote
ICCV
2001
IEEE
16 years 3 months ago
2001
IEEE
?This paper presents a computational paradigm called Data-Driven Markov Chain Monte Carlo (DDMCMC) for image segmentation in the Bayesian statistical framework. The paper contribut...