Sciweavers

3047 search results - page 276 / 610
» Randomized Parallel Selection
Sort
View
VLSISP
2008
173views more  VLSISP 2008»
15 years 2 months ago
Fast Bit Gather, Bit Scatter and Bit Permutation Instructions for Commodity Microprocessors
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
Yedidya Hilewitz, Ruby B. Lee
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 2 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
87
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
Gossiping with Multiple Messages
Abstract— This paper investigates the dissemination of multiple pieces of information in large networks where users contact each other in a random uncoordinated manner, and users...
Sujay Sanghavi, Bruce Hajek, Laurent Massouli&eacu...
134
Voted
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
15 years 3 months ago
Informative sampling for large unbalanced data sets
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...
Zhenyu Lu, Anand I. Rughani, Bruce I. Tranmer, Jos...
ISCA
2010
IEEE
176views Hardware» more  ISCA 2010»
15 years 6 months ago
Forwardflow: a scalable core for power-constrained CMPs
Chip Multiprocessors (CMPs) are now commodity hardware, but commoditization of parallel software remains elusive. In the near term, the current trend of increased coreper-socket c...
Dan Gibson, David A. Wood