Sciweavers

3257 search results - page 134 / 652
» Some Results on Effective Randomness
Sort
View
SIGIR
2008
ACM
14 years 10 months ago
Multi-document summarization using cluster-based link analysis
The Markov Random Walk model has been recently exploited for multi-document summarization by making use of the link relationships between sentences in the document set, under the ...
Xiaojun Wan, Jianwu Yang
MST
2010
98views more  MST 2010»
14 years 8 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
14 years 11 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
BMCBI
2007
114views more  BMCBI 2007»
14 years 10 months ago
False occurrences of functional motifs in protein sequences highlight evolutionary constraints
Background: False occurrences of functional motifs in protein sequences can be considered as random events due solely to the sequence composition of a proteome. Here we use a nume...
Allegra Via, Pier Federico Gherardini, Enrico Ferr...
VLSID
2006
IEEE
129views VLSI» more  VLSID 2006»
15 years 10 months ago
A Stimulus-Free Probabilistic Model for Single-Event-Upset Sensitivity
With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), Single-Eventtransients (SET), is a ...
Mohammad Gh. Mohammad, Laila Terkawi, Muna Albasma...