Sciweavers

526 search results - page 104 / 106
» Increments of Random Partitions
Sort
View
TON
2008
103views more  TON 2008»
13 years 7 months ago
On the race of worms, alerts, and patches
We study the effectiveness of automatic patching and quantify the speed of patch or alert dissemination required for worm containment. We focus on random scanning as this is repres...
Milan Vojnovic, Ayalvadi J. Ganesh
BMCBI
2004
111views more  BMCBI 2004»
13 years 7 months ago
Multiclass discovery in array data
Background: A routine goal in the analysis of microarray data is to identify genes with expression levels that correlate with known classes of experiments. In a growing number of ...
Yingchun Liu, Markus Ringnér
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 6 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
PVLDB
2008
126views more  PVLDB 2008»
13 years 6 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
QEST
2010
IEEE
13 years 5 months ago
Automatic Compositional Reasoning for Probabilistic Model Checking of Hardware Designs
Adaptive techniques like voltage and frequency scaling, process variations and the randomness of input data contribute signi cantly to the statistical aspect of contemporary hardwa...
Jayanand Asok Kumar, Shobha Vasudevan