7228 search results - page 394 / 1446 » From Algorithmic to Subjective Randomness |
171
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analy...
176
click to vote
OL
2007
15 years 6 months ago
2007
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
196
Voted
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
166
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
153
click to vote
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...