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...
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 ...
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...
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...
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...
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 ...
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...
— 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...