Sciweavers

2609 search results - page 106 / 522
» Optimizing for parallelism and data locality
Sort
View
ICASSP
2011
IEEE
14 years 4 months ago
Semantic data selection for vertical business voice search
Local business voice search is a popular application for mobile phones, where hands-free interaction and speed are critical to users. However, speech recognition accuracy is still...
Giuseppe Di Fabbrizio, Diamantino Caseiro, Amanda ...
92
Voted
ICIP
2008
IEEE
15 years 7 months ago
Localized and computationally efficient approach to shift-variant image deblurring
A new localized and computationally efficient approach is presented for shift/space-variant image restoration. Unlike conventional approaches, it models shift-variant blurring in...
Murali Subbarao, Youn-sik Kang, Satyaki Dutta, Xue...
106
Voted
COMAD
1994
15 years 2 months ago
An Adaptive, Load Balancing Parallel Join Algorithm
Many parallel join algorithms have been proposed in the last several years. However, most of these algorithms require that the amount of data to be joined is known in advance in o...
Minesh B. Amin, Donovan A. Schneider, V. Singh
102
Voted
PPOPP
2010
ACM
15 years 10 months ago
Structure-driven optimizations for amorphous data-parallel programs
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
Mario Méndez-Lojo, Donald Nguyen, Dimitrios...
CLUSTER
2003
IEEE
15 years 6 months ago
Optimized Implementation of Extendible Hashing to Support Large File System Directory
Extendible hashing is a kind of fast indexing technology; it provides with a way of storing structural data records so that each of them can be gotten very quickly. In this paper,...
Rongfeng Tang, Dan Meng, Sining Wu