Sciweavers

139 search results - page 9 / 28
» Reducibilities Relating to Schnorr Randomness
Sort
View
AML
2006
83views more  AML 2006»
13 years 10 months ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn
DCC
2001
IEEE
14 years 10 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher
JMLR
2010
158views more  JMLR 2010»
13 years 5 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe
WIOPT
2011
IEEE
13 years 2 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...
TFS
2010
116views Education» more  TFS 2010»
13 years 5 months ago
Fuzzy Filtering for Physiological Signal Analysis
This study suggests the use of fuzzy-filtering algorithms to deal with the uncertainties associated to the analysis of physiological signals. The signal characteristics, for a give...
Mohit Kumar, Matthias Weippert, Dagmar Arndt, Stef...