Sciweavers

9209 search results - page 138 / 1842
» Data Space Randomization
Sort
View
171
Voted
CSR
2011
Springer
14 years 8 months ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov
JDA
2008
100views more  JDA 2008»
15 years 4 months ago
Efficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
Jens Gustedt
TIT
2008
106views more  TIT 2008»
15 years 4 months ago
Byzantine Modification Detection in Multicast Networks With Random Network Coding
This paper gives an information theoretic approach for detecting Byzantine modifications in networks employing random linear network coding. Each exogenous source packet is augmen...
Tracey Ho, Ben Leong, Ralf Koetter, Muriel M&eacut...
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
13 years 7 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
JMLR
2010
94views more  JMLR 2010»
15 years 3 months ago
A Rotation Test to Verify Latent Structure
We consider here how to tell whether a latent variable that has been estimated in a multivariate regression context might be real. Often a followup investigation will find a real...
Patrick O. Perry, Art B. Owen