Sciweavers

3208 search results - page 212 / 642
» A Lower Bound for Primality
Sort
View
ALENEX
2007
130views Algorithms» more  ALENEX 2007»
15 years 8 months ago
Locating Guards for Visibility Coverage of Polygons
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
Yoav Amit, Joseph S. B. Mitchell, Eli Packer
ICONIP
2004
15 years 8 months ago
Variational Information Maximization for Neural Coding
Abstract. Mutual Information (MI) is a long studied measure of coding efficiency, and many attempts to apply it to population coding have been made. However, this is a computationa...
Felix V. Agakov, David Barber
CORR
2008
Springer
100views Education» more  CORR 2008»
15 years 6 months ago
Lossy Source Transmission over the Relay Channel
Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is propo...
Deniz Gündüz, Elza Erkip, Andrea J. Gold...
ECCC
2010
89views more  ECCC 2010»
15 years 6 months ago
Estimating the unseen: A sublinear-sample canonical estimator of distributions
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...
Gregory Valiant, Paul Valiant
COMBINATORICS
2007
55views more  COMBINATORICS 2007»
15 years 6 months ago
A Note on a Problem of Hilliker and Straus
For a prime p and a vector ¯α = (α1, . . . , αk) ∈ Zk p let f (¯α, p) be the largest n such that in each set A ⊆ Zp of n elements one can find x which has a unique repr...
Miroslawa Janczak