548 search results - page 70 / 110 » Global value numbering using random interpretation |
PADL
2012
Springer
12 years 5 months ago
2012
Springer
We begin with a functional reactive programming (FRP) model in which every program is viewed as a signal function that converts a stream of input values into a stream of output va...
ICCD
2004
IEEE
14 years 6 months ago
2004
IEEE
Many test data compression schemes are based on LFSR reseeding. A drawback of these schemes is that the unspecified bits are filled with random values resulting in a large number ...
COMBINATORICS
2004
13 years 9 months ago
2004
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
SPIRE
2010
Springer
13 years 8 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— The need for efficient counter architecture has arisen for the following two reasons. Firstly, a number of data streaming algorithms and network management applications requir...