Sciweavers

2609 search results - page 491 / 522
» Optimizing for parallelism and data locality
Sort
View
ICCAD
2006
IEEE
99views Hardware» more  ICCAD 2006»
15 years 7 months ago
Information theoretic approach to address delay and reliability in long on-chip interconnects
With shrinking feature size and growing integration density in the Deep Sub-Micron technologies, the global buses are fast becoming the “weakest-links” in VLSI design. They ha...
Rohit Singhal, Gwan S. Choi, Rabi N. Mahapatra
ISCA
2010
IEEE
405views Hardware» more  ISCA 2010»
15 years 3 months ago
Debunking the 100X GPU vs. CPU myth: an evaluation of throughput computing on CPU and GPU
Recent advances in computing have led to an explosion in the amount of data being generated. Processing the ever-growing data in a timely manner has made throughput computing an i...
Victor W. Lee, Changkyu Kim, Jatin Chhugani, Micha...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 2 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
ECCV
2010
Springer
14 years 10 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
ICDE
2011
IEEE
258views Database» more  ICDE 2011»
14 years 1 months ago
SystemML: Declarative machine learning on MapReduce
Abstract—MapReduce is emerging as a generic parallel programming paradigm for large clusters of machines. This trend combined with the growing need to run machine learning (ML) a...
Amol Ghoting, Rajasekar Krishnamurthy, Edwin P. D....