Sciweavers

229 search results - page 10 / 46
» Ergodic-Type Characterizations of Algorithmic Randomness
Sort
View
117
Voted
JMLR
2008
83views more  JMLR 2008»
15 years 2 months ago
Generalization from Observed to Unobserved Features by Clustering
We argue that when objects are characterized by many attributes, clustering them on the basis of a random subset of these attributes can capture information on the unobserved attr...
Eyal Krupka, Naftali Tishby
102
Voted
NAR
2006
107views more  NAR 2006»
15 years 2 months ago
CorGen - measuring and generating long-range correlations for DNA sequence analysis
CorGen is a web server that measures long-range correlations in the base composition of DNA and generates random sequences with the same correlation parameters. Long-range correla...
Philipp W. Messer, Peter F. Arndt
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 9 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
91
Voted
COLT
2003
Springer
15 years 7 months ago
On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
John Case, Sanjay Jain, Franco Montagna, Giulia Si...
CJ
2011
14 years 6 months ago
Dynamic Multipath Allocation in Ad Hoc Networks
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/â...
Yosi Ben-Asher, Sharoni Feldman, Moran Feldman