Sciweavers

4103 search results - page 286 / 821
» Some results on the Collatz problem
Sort
View
166
Voted
ITNG
2006
IEEE
16 years 25 days ago
Two-Party Private Vector Dominance: The All-Or-Nothing Deal
Alice holds a secret integer a while Bob holds a secret integer b, they want to decide on the predicate a > b with no information revealed other than the result. This is the we...
Maged Hamada Ibrahim
ESA
2003
Springer
95views Algorithms» more  ESA 2003»
16 years 1 days ago
Sequencing by Hybridization in Few Rounds
Sequencing by Hybridization (SBH) is a method for reconstructing an unknown DNA string based on obtaining, through hybridization experiments, whether certain short strings appear ...
Dekel Tsur
SYNTHESE
2008
84views more  SYNTHESE 2008»
15 years 6 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein
CONCURRENCY
1998
139views more  CONCURRENCY 1998»
15 years 6 months ago
Applications experience in Jade
This paper presents our experience developing applications in Jade, a portable, implicitly parallel programming language designed for exploiting task-level concurrency. Jade progr...
Martin C. Rinard
TON
2002
75views more  TON 2002»
15 years 6 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda