Sciweavers

2228 search results - page 213 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
ATAL
2010
Springer
15 years 7 months ago
Learning multirobot joint action plans from simultaneous task execution demonstrations
The central problem of designing intelligent robot systems which learn by demonstrations of desired behaviour has been largely studied within the field of robotics. Numerous archi...
Murilo Fernandes Martins, Yiannis Demiris
IJON
2008
101views more  IJON 2008»
15 years 6 months ago
Learning dynamics and robustness of vector quantization and neural gas
Various alternatives have been developed to improve the Winner-Takes-All (WTA) mechanism in vector quantization, including the Neural Gas (NG). However, the behavior of these algo...
Aree Witoelar, Michael Biehl, Anarta Ghosh, Barbar...
ISPASS
2007
IEEE
16 years 26 days ago
Simplifying Active Memory Clusters by Leveraging Directory Protocol Threads
Address re-mapping techniques in so-called active memory systems have been shown to dramatically increase the performance of applications with poor cache and/or communication beha...
Dhiraj D. Kalamkar, Mainak Chaudhuri, Mark Heinric...
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 10 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
DEXA
2005
Springer
80views Database» more  DEXA 2005»
16 years 3 days ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu