973 search results - page 192 / 195 » New Bounds on Crossing Numbers |
ANCS
2009
ACM
14 years 7 months ago
2009
ACM
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
104
click to vote
JOC
2011
14 years 4 months ago
2011
In light of the growing complexity of cryptographic protocols and applications, it becomes highly desirable to mechanize — and eventually automate — the security analysis of p...
124
click to vote
SIAMMAX
2010
14 years 4 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
115
Voted
TMC
2012
12 years 12 months ago
2012
—Backoff misbehavior, in which a wireless node deliberately manipulates its backoff time, can induce significant network problems, such as severe unfairness and denial-of-servic...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...