Sciweavers

CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 8 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff
CORR
2008
Springer
78views Education» more  CORR 2008»
13 years 8 months ago
Set theoretical Representations of Integers, I
Marie Ferbus-Zanda, Serge Grigorieff
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 8 months ago
Estimating Signals with Finite Rate of Innovation from Noisy Samples: A Stochastic Algorithm
As an example of the recently introduced concept of rate of innovation, signals that are linear combinations of a finite number of Diracs per unit time can be acquired by linear fi...
Vincent Yan Fu Tan, Vivek K. Goyal
CORR
2008
Springer
68views Education» more  CORR 2008»
13 years 8 months ago
Improved lower bound for deterministic broadcasting in radio networks
We consider the problem of deterministic broadcasting in radio networks when the nodes have limited knowledge about the topology of the network. We show that for every determinist...
Carlos Brito, Shailesh Vaya
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 8 months ago
Investigating the Potential of Test-Driven Development for Spreadsheet Engineering
It is widely documented that the absence of a structured approach to spreadsheet engineering is a key factor in the high level of spreadsheet errors. In this paper we propose and ...
Alan Rust, Brian Bishop, Kevin McDaid
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 8 months ago
Breaking One-Round Key-Agreement Protocols in the Random Oracle Model
In this work we deal with one-round key-agreement protocols, called Merkle's Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a rando...
Miroslava Sotáková
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 8 months ago
A Neyman-Pearson Approach to Universal Erasure and List Decoding
When information is to be transmitted over an unknown, possibly unreliable channel, an erasure option at the decoder is desirable. Using constant-composition random codes, we propo...
Pierre Moulin
CORR
2008
Springer
152views Education» more  CORR 2008»
13 years 8 months ago
It's Not What You Have, But How You Use It: Compromises in Mobile Device Use
As users begin to use many more devices for personal information management (PIM) than just the traditional desktop computer, it is essential for HCI researchers to understand how...
Manas Tungare, Manuel A. Pérez-Quiño...
CORR
2008
Springer
156views Education» more  CORR 2008»
13 years 8 months ago
Artificial Immune Systems (AIS) - A New Paradigm for Heuristic Decision Making
Over the last few years, more and more heuristic decision making techniques have been inspired by nature, e.g. evolutionary algorithms, ant colony optimisation and simulated annea...
Uwe Aickelin