1686 search results - page 160 / 338 » Programs as polygraphs: computability and complexity |
157
Voted
HRI
2010
ACM
15 years 3 months ago
2010
ACM
In this paper a system, which is driven through natural language, that allows operators to select and manipulate objects in the environment using an industrial robot is proposed. I...
132
Voted
TCS
2008
15 years 3 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
223
Voted
ASPLOS
2009
ACM
16 years 4 months ago
2009
ACM
Even though graphics processors (GPUs) are becoming increasingly popular for general purpose computing, current (and likely near future) generations of GPUs do not provide hardwar...
157
Voted
ML
2000
ACM
15 years 3 months ago
2000
ACM
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...
140
Voted
TMI
2002
15 years 3 months ago
2002
In this paper, the current status of cardiac image registration methods is reviewed. The combination of information from multiple cardiac image modalities, such as magnetic resonan...