6202 search results - page 862 / 1241 » Without Loss of Generality |
208
click to vote
CCS
2010
ACM
15 years 7 months ago
2010
ACM
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
229
click to vote
CCS
2010
ACM
15 years 7 months ago
2010
ACM
Models based on system calls are a popular and common approach to characterize the run-time behavior of programs. For example, system calls are used by intrusion detection systems...
183
click to vote
SIGECOM
2010
ACM
15 years 7 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
219
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
An increasing number of applications operate on data obtained from the Web. These applications typically maintain local copies of the web data to avoid network latency in data acc...
190
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: High-throughput screens comparing growth rates of arrays of distinct micro-organism cultures on solid agar are useful, rapid methods of quantifying genetic interaction...