Sciweavers

7200 search results - page 316 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
CONCURRENCY
2004
77views more  CONCURRENCY 2004»
15 years 6 months ago
Grids of agents for computer and telecommunication network management
The centralized system approach for computer and telecommunication network management has been presenting scalability problems along with the growth in the number and diversity of...
Marcos Dias de Assunção, Fernando Lu...
CAD
2000
Springer
15 years 6 months ago
Efficiently computing and updating triangle strips for real-time rendering
Triangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In this paper we survey the efficient generatio...
Jihad El-Sana, Francine Evans, Aravind Kalaiah, Am...
ECCC
1998
88views more  ECCC 1998»
15 years 6 months ago
Computational Indistinguishability: A Sample Hierarchy
We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given ...
Oded GoldreichMadhu Sudan
IEEEHPCS
2010
15 years 5 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
ERSA
2010
119views Hardware» more  ERSA 2010»
15 years 4 months ago
Performance Visualization and Exploration for Reconfigurable Computing Applications
Reconfigurable computing (RC) applications have the potential for significant performance while consuming little power. Although runtime performance analysis of RC applications has...
Seth Koehler, Alan D. George