Sciweavers

165 search results - page 32 / 33
» Fast Routing Table Lookup Using CAMs
Sort
View
ICML
1996
IEEE
14 years 7 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
SPAA
2006
ACM
14 years 7 days ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
JPDC
2006
133views more  JPDC 2006»
13 years 6 months ago
Locality in structured peer-to-peer networks
Distributed hash tables (DHTs), used in a number of structured peer-to-peer (P2P) systems provide efficient mechanisms for resource placement and location. A key distinguishing fe...
Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Gr...
ICIP
2008
IEEE
14 years 8 months ago
Motion estimation with entropy coding considerations in H.264/AVC
In many modern video encoders, motion estimation is usually formulated as a Lagrangian cost function that balances motion prediction accuracy and the rate to transmit motion vecto...
Zhen Li, Alexis Michael Tourapis
VISUALIZATION
1999
IEEE
13 years 10 months ago
Splatting Without the Blur
Splatting is a volume rendering algorithm that combines efficient volume projection with a sparse data representation: Only voxels that have values inside the iso-range need to be...
Klaus Mueller, Torsten Möller, Roger Crawfis