Sciweavers

96 search results - page 13 / 20
» Efficient Mapping of Addition Recurrence Algorithms in CMOS
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
ATAL
2008
Springer
13 years 8 months ago
Autonomous transfer for reinforcement learning
Recent work in transfer learning has succeeded in making reinforcement learning algorithms more efficient by incorporating knowledge from previous tasks. However, such methods typ...
Matthew E. Taylor, Gregory Kuhlmann, Peter Stone
DAC
1994
ACM
13 years 10 months ago
Synthesis of Instruction Sets for Pipelined Microprocessors
We present a systematic approach to synthesize an instruction set such that the given application software can be efficiently mapped to a parameterized, pipelined microarchitectur...
Ing-Jer Huang, Alvin M. Despain
3DPVT
2004
IEEE
125views Visualization» more  3DPVT 2004»
13 years 10 months ago
GPU-Assisted Z-Field Simplification
Height fields and depth maps which we collectively refer to as z-fields, usually carry a lot of redundant information and are often used in real-time applications. This is the rea...
Alexander Bogomjakov, Craig Gotsman
ANTSW
2006
Springer
13 years 10 months ago
Covering a Continuous Domain by Distributed, Limited Robots
We present an algorithm for covering continuous domains by primitive robots whose only ability is to mark visited places with pheromone and to sense the level of the pheromone in t...
Eliyahu Osherovich, Alfred M. Bruckstein, Vladimir...