Sciweavers

7200 search results - page 171 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
EUROPAR
2010
Springer
15 years 6 months ago
Power-Efficient Spilling Techniques for Chip Multiprocessors
Abstract. Current trends in CMPs indicate that the core count will increase in the near future. One of the main performance limiters of these forthcoming microarchitectures is the ...
Enric Herrero, José González, Ramon ...
SAC
2008
ACM
15 years 5 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee
CIKM
2006
Springer
15 years 10 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum
ICC
2007
IEEE
117views Communications» more  ICC 2007»
16 years 23 days ago
On The Optimal Amount of Training for Peak-Power-Limited Rayleigh Fading Channels
— We consider the optimal amount of training for single-antenna Rayleigh flat fading channels with peak-powerlimited input. The receiver uses known training symbols to perform m...
Wei Mao, Xin Su, Ming Zhao 0001, Xibin Xu
CONSTRAINTS
1999
105views more  CONSTRAINTS 1999»
15 years 6 months ago
Algorithmic Power from Declarative Use of Redundant Constraints
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
Maarten H. van Emden