Sciweavers

3257 search results - page 29 / 652
» Some Results on Effective Randomness
Sort
View
JSYML
2008
108views more  JSYML 2008»
13 years 9 months ago
Randomness, lowness and degrees
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
George Barmpalias, Andrew E. M. Lewis, Mariya Ivan...
SIAMSC
2010
130views more  SIAMSC 2010»
13 years 4 months ago
Quasi-Monte Carlo Method for Infinitely Divisible Random Vectors via Series Representations
Infinitely divisible random vector without Gaussian component admits representations of shot noise series. Due to possible slow convergence of the series, they have not been inves...
Junichi Imai, Reiichiro Kawai
CIKM
2008
Springer
13 years 11 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell
JDCTA
2010
250views more  JDCTA 2010»
13 years 4 months ago
A Novel Non-Expansion Visual Secret Sharing Scheme For Binary Image
In visual cryptography, the secret can be any written text, graphical representation, or picture. This technique, some time called visual secret sharing (VSS), allows visual infor...
Thekra Abbas, Zou Beiji
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 11 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter