Sciweavers

CORR
2008
Springer
70views Education» more  CORR 2008»
14 years 18 days 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
115views Education» more  CORR 2008»
14 years 18 days ago
Lower Bounds on the Rate-Distortion Function of LDGM Codes
Abstract-- We analyze the performance of low-density generator matrix (LDGM) codes for lossy source coding. We first develop a generic technique for deriving lower bounds on the ef...
Alexandros G. Dimakis, Martin J. Wainwright, Kanna...
CORR
2008
Springer
93views Education» more  CORR 2008»
14 years 18 days ago
Transitive-Closure Spanners
Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung...
CORR
2008
Springer
127views Education» more  CORR 2008»
14 years 18 days ago
A Very Efficient Scheme for Estimating Entropy of Data Streams Using Compressed Counting
Compressed Counting (CC) was recently proposed for approximating the th frequency moments of data streams, for 0 < 2. Under the relaxed strict-Turnstile model, CC dramaticall...
Ping Li
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 18 days ago
Our Brothers' Keepers: Secure Routing with High Performance
The Trinity [1] spam classification system is based on a distributed hash table that is implemented using a structured peer-to-peer overlay. Such an overlay must be capable of proc...
Alex Brodsky, Scott Lindenberg
CORR
2008
Springer
114views Education» more  CORR 2008»
14 years 18 days ago
Algorithmic Pricing via Virtual Valuations
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
Shuchi Chawla, Jason D. Hartline, Robert Kleinberg
CORR
2008
Springer
50views Education» more  CORR 2008»
14 years 18 days ago
Periodicity, repetitions, and orbits of an automatic sequence
Jean-Paul Allouche, Narad Rampersad, Jeffrey Shall...
CORR
2008
Springer
97views Education» more  CORR 2008»
14 years 18 days ago
An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience
Consider an asynchronous system with private channels and n processes, up to t of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement pr...
Ittai Abraham, Danny Dolev, Joseph Y. Halpern
CORR
2008
Springer
116views Education» more  CORR 2008»
14 years 18 days ago
The finite harmonic oscillator and its applications to sequences, communication and radar
A novel system, called the oscillator system, consisting of order of p 3 functions (signals) on the finite field p; with p an odd prime, is described and studied. The new functions...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
CORR
2008
Springer
66views Education» more  CORR 2008»
14 years 18 days ago
The finite harmonic oscillator and its associated sequences
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen