297 search results - page 51 / 60 » Every Sequence Is Decompressible from a Random One |
ACMMSP
2004
ACM
15 years 4 months ago
2004
ACM
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
68
Voted
ESOP
2001
Springer
15 years 3 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
IJDAR
2010
14 years 9 months ago
2010
The set of references that typically appear toward the end of journal articles is sometimes, though not always, a field in bibliographic (citation) databases. But even if referenc...
WWW
2008
ACM
15 years 11 months ago
2008
ACM
We study in this paper the Web forum crawling problem, which is a very fundamental step in many Web applications, such as search engine and Web data mining. As a typical user-crea...