Sciweavers

5 search results - page 1 / 1
» Conditional Computational Entropy, or Toward Separating Pseu...
Sort
View
EUROCRYPT
2007
Springer
13 years 11 months ago
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin
IJIT
2004
13 years 6 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
DCC
2007
IEEE
14 years 4 months ago
Distributed Functional Compression through Graph Coloring
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
Devavrat Shah, Muriel Médard, Sidharth Jagg...
ICIP
2004
IEEE
14 years 6 months ago
A hidden markov model framework for traffic event detection using video features
We present a novel approach for highway traffic event detection. Our algorithm extracts features directly from the compressed video and automatically detects traffic events using ...
Xiaokun Li, Fatih Murat Porikli
DCC
2006
IEEE
14 years 4 months ago
The B-coder: An Improved Binary Arithmetic Coder and Probability Estimator
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
Benjamin Kelly, David F. Brailsford