CORR
2008
Springer
13 years 10 months ago
2008
Springer
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 ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
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...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
CORR
2008
Springer
13 years 10 months ago
2008
Springer
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...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
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...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
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 ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
CORR
2008
Springer
13 years 10 months ago
2008
Springer
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...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
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...
CORR
2008
Springer
13 years 10 months ago
2008
Springer