Sciweavers

179 search results - page 26 / 36
» Fast performance estimation of block codes
Sort
View
164
Voted
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 6 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
SIGCOMM
2012
ACM
13 years 4 months ago
Spinal codes
A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary wit...
Jonathan Perry, Peter Iannucci, Kermin Fleming, Ha...
148
Voted
VLSID
2004
IEEE
209views VLSI» more  VLSID 2004»
16 years 2 months ago
An Architecture for Motion Estimation in the Transform Domain
demanding algorithm of a video encoder. It is known that about 60% ~ 80% of the total computation time is consumed for motion estimation [1]. The second is its high impact on the v...
J. Lee, Narayanan Vijaykrishnan, Mary Jane Irwin, ...
146
Voted
PVM
2010
Springer
15 years 7 days ago
Toward Performance Models of MPI Implementations for Understanding Application Scaling Issues
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
Torsten Hoefler, William Gropp, Rajeev Thakur, Jes...
137
Voted
RTAS
2010
IEEE
15 years 7 days ago
DARTS: Techniques and Tools for Predictably Fast Memory Using Integrated Data Allocation and Real-Time Task Scheduling
—Hardware-managed caches introduce large amounts of timing variability, complicating real-time system design. One alternative is a memory system with scratchpad memories which im...
Sangyeol Kang, Alexander G. Dean