683 search results - page 124 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
AROBOTS
2002
13 years 7 months ago
2002
The complexity of the kinematic and dynamic structure of humanoid robots make conventional analytical approaches to control increasingly unsuitable for such systems. Learning techn...
FCSC
2010
13 years 5 months ago
2010
Graphical models have become the basic framework for topic based probabilistic modeling. Especially models with latent variables have proved to be effective in capturing hidden str...
JNW
2008
13 years 7 months ago
2008
Multi-path routing allows building and use of multiple paths for routing between a source-destination pair. This paper investigates the problem of selecting multiple routing paths ...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
MICRO
2002
IEEE
14 years 20 days ago
2002
IEEE
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...