297 search results - page 56 / 60 » Every Sequence Is Decompressible from a Random One |
175
Voted
POPL
2006
ACM
15 years 11 months ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
184
click to vote
SIGMOD
2009
ACM
15 years 11 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
INFOCOM
2009
IEEE
15 years 5 months ago
2009
IEEE
—In this paper, we present DHTBL, an anti-spam blacklist built upon a novel secure distributed hash table (DHT). We show how DHTBL can be used to replace existing DNS-based black...
104
Voted
EVOW
2001
Springer
15 years 3 months ago
2001
Springer
The integrated circuits design flow is rapidly moving towards higher description levels. However, test-related activities are lacking behind this trend, mainly since effective faul...
129
Voted
SIGECOM
2011
ACM
14 years 1 months ago
2011
ACM
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...