Sciweavers

194 search results - page 14 / 39
» Randomness for Free
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
14 years 9 days ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
BMCBI
2006
158views more  BMCBI 2006»
13 years 8 months ago
Detection of non-coding RNAs on the basis of predicted secondary structure formation free energy change
Background: Non-coding RNAs (ncRNAs) have a multitude of roles in the cell, many of which remain to be discovered. However, it is difficult to detect novel ncRNAs in biochemical s...
Andrew V. Uzilov, Joshua M. Keegan, David H. Mathe...
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
14 years 3 months ago
An Analysis of Random-Walk Cuckoo Hashing
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
Alan M. Frieze, Páll Melsted, Michael Mitze...
EGH
2010
Springer
13 years 6 months ago
GPU random numbers via the tiny encryption algorithm
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) a...
Fahad Zafar, Marc Olano, Aaron Curtis
USENIX
2007
13 years 10 months ago
A Comparison of Structured and Unstructured P2P Approaches to Heterogeneous Random Peer Selection
Random peer selection is used by numerous P2P applications; examples include application-level multicast, unstructured file sharing, and network location mapping. In most of thes...
Vivek Vishnumurthy, Paul Francis