Sciweavers

202 search results - page 5 / 41
» Algorithmic Information Theory and Foundations of Probabilit...
Sort
View
IPSN
2004
Springer
14 years 1 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
POPL
2003
ACM
14 years 9 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
TACAS
2010
Springer
137views Algorithms» more  TACAS 2010»
14 years 3 months ago
Statistical Measurement of Information Leakage
Information theory provides a range of useful methods to analyse probability distributions and these techniques have been successfully applied to measure information flow and the ...
Konstantinos Chatzikokolakis, Tom Chothia, Apratim...
PARA
2004
Springer
14 years 1 months ago
Automatic Derivation of Linear Algebra Algorithms with Application to Control Theory
It is our belief that the ultimate automatic system for deriving linear algebra libraries should be able to generate a set of algorithms starting from the mathematical specificati...
Paolo Bientinesi, Sergey Kolos, Robert A. van de G...
WSDM
2012
ACM
245views Data Mining» more  WSDM 2012»
12 years 4 months ago
The early bird gets the buzz: detecting anomalies and emerging trends in information networks
In this work we propose a novel approach to anomaly detection in streaming communication data. We first build a stochastic model for the system based on temporal communication pa...
Brian Thompson