4451 search results - page 500 / 891 » On Random Ordering Constraints |
155
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...
146
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
209
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider streaming video content over an overlay network of peer nodes. Each of the nodes employs a mesh-pull mechanism to organize the download of data units from its neighbou...
174
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper we propose to construct an flexible delay line with maximum delay d by parallel non-overtaking delay lines. We show that for a fixed number of non-overtaking del...
190
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...