Sciweavers

502 search results - page 70 / 101
» On the Practical Performance of Rateless Codes
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 2 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
ASPLOS
2004
ACM
15 years 3 months ago
HIDE: an infrastructure for efficiently protecting information leakage on the address bus
+ XOM-based secure processor has recently been introduced as a mechanism to provide copy and tamper resistant execution. XOM provides support for encryption/decryption and integrit...
Xiaotong Zhuang, Tao Zhang, Santosh Pande
ESEM
2007
ACM
15 years 1 months ago
A Critical Analysis of Empirical Research in Software Testing
In the foreseeable future, software testing will remain one of the best tools we have at our disposal to ensure software dependability. Empirical studies are crucial to software t...
Lionel C. Briand
OOPSLA
2005
Springer
15 years 3 months ago
Relational queries over program traces
Instrumenting programs with code to monitor runtime behavior is a common technique for profiling and debugging. In practice, instrumentation is either inserted manually by progra...
Simon Goldsmith, Robert O'Callahan, Alexander Aike...
TWC
2008
133views more  TWC 2008»
14 years 9 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...