Sciweavers

6437 search results - page 937 / 1288
» Parallel Algorithms for Arrangements
Sort
View
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
16 years 6 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
MIR
2010
ACM
200views Multimedia» more  MIR 2010»
16 years 1 months ago
Controlling your TV with gestures
Vision-based user interfaces enable natural interaction modalities such as gestures. Such interfaces require computationally intensive video processing at low latency. We demonstr...
Ming-yu Chen, Lily B. Mummert, Padmanabhan Pillai,...
CGO
2009
IEEE
16 years 1 months ago
Fast Track: A Software System for Speculative Program Optimization
—Fast track is a software speculation system that enables unsafe optimization of sequential code. It speculatively runs optimized code to improve performance and then checks the ...
Kirk Kelsey, Tongxin Bai, Chen Ding, Chengliang Zh...
WSDM
2009
ACM
148views Data Mining» more  WSDM 2009»
16 years 1 months ago
Information arbitrage across multi-lingual Wikipedia
The rapid globalization of Wikipedia is generating a parallel, multi-lingual corpus of unprecedented scale. Pages for the same topic in many different languages emerge both as a r...
Eytan Adar, Michael Skinner, Daniel S. Weld
ICS
2009
Tsinghua U.
16 years 1 months ago
Adagio: making DVS practical for complex HPC applications
Power and energy are first-order design constraints in high performance computing. Current research using dynamic voltage scaling (DVS) relies on trading increased execution time...
Barry Rountree, David K. Lowenthal, Bronis R. de S...