Sciweavers

448 search results - page 69 / 90
» Dynamic Algorithms for the Dyck Languages
Sort
View
PPOPP
2011
ACM
14 years 15 days ago
Cooperative reasoning for preemptive execution
We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potent...
Jaeheon Yi, Caitlin Sadowski, Cormac Flanagan
94
Voted
DAC
2005
ACM
15 years 10 months ago
Hardware speech recognition for user interfaces in low cost, low power devices
We propose a system architecture for real-time hardware speech recognition on low-cost, power-constrained devices. The system is intended to support real-time speech-based user in...
Sergiu Nedevschi, Rabin K. Patra, Eric A. Brewer
POPL
2007
ACM
15 years 10 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
96
Voted
IPPS
2000
IEEE
15 years 2 months ago
Run-Time Support for Adaptive Load Balancing
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
Milind A. Bhandarkar, Robert Brunner, Laxmikant V....
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
14 years 9 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro