Sciweavers

CORR
2008
Springer
119views Education» more  CORR 2008»
13 years 5 months ago
Learning Low Rank Matrices from O(n) Entries
How many random entries of an n
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 5 months ago
Distributed Source Coding using Abelian Group Codes
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
Dinesh Krithivasan, S. Sandeep Pradhan
CORR
2008
Springer
70views Education» more  CORR 2008»
13 years 5 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
Cristian S. Calude, Nicholas J. Hay
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 5 months ago
Tight Bounds for Blind Search on the Integers
We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wege...
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 5 months ago
Estimating and Sampling Graphs with Multidimensional Random Walks
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
Bruno F. Ribeiro, Donald F. Towsley
CCR
2008
112views more  CCR 2008»
13 years 5 months ago
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks
In the last few years, several studies have analyzed the performance of flooding and random walks as querying mechanisms for unstructured wireless sensor networks. However, most o...
Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash S...
BMCBI
2007
114views more  BMCBI 2007»
13 years 5 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...
AICT
2008
IEEE
119views Communications» more  AICT 2008»
13 years 5 months ago
Simplification of Frequency Test for Random Number Generation Based on Chi-Square
This paper presents the simplified method of random test suite based on the frequency (block) test. The test is used to check the first property of random numbers which is to have ...
Kruawan Wongpanya, Keattisak Sripimanwat, Kanok Je...
ICASSP
2010
IEEE
13 years 5 months ago
Evaluation of random-projection-based feature combination on speech recognition
Random projection has been suggested as a means of dimensionality reduction, where the original data are projected onto a subspace using a random matrix. It represents a computati...
Tetsuya Takiguchi, Jeff Bilmes, Mariko Yoshii, Yas...
WCE
2007
13 years 6 months ago
On the Statistical Distribution of Stationary Segment Lengths of Road Vehicles Vibrations
— This paper presents an important outcome of a research programme which focuses on the development of a method for synthesizing, under controlled conditions in the laboratory, t...
Vincent Rouillard