Sciweavers

2520 search results - page 5 / 504
» The complexity of approximating entropy
Sort
View
APPML
2007
47views more  APPML 2007»
13 years 9 months ago
Existence and bounds for the half-moment entropy approximation to radiative transfer
We establish existence, uniqueness and a priori bounds for the half moment entropy approximation to radiative heat transfer. The bounds are physically reasonable and underline the...
Martin Frank, René Pinnau
CDC
2009
IEEE
150views Control Systems» more  CDC 2009»
14 years 2 months ago
Cooperative adaptive sampling via approximate entropy maximization
— This work deals with a group of mobile sensors sampling a spatiotemporal random field whose mean is unknown and covariance is known up to a scaling parameter. The Bayesian pos...
Rishi Graham, Jorge Cortés
ICASSP
2011
IEEE
13 years 1 months ago
Entropy estimation using the principle of maximum entropy
In this paper, we present a novel entropy estimator for a given set of samples drawn from an unknown probability density function (PDF). Counter to other entropy estimators, the e...
Behrouz Behmardi, Raviv Raich, Alfred O. Hero
AMC
2008
78views more  AMC 2008»
13 years 9 months ago
Information processing in complex networks: Graph entropy and information functionals
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
Matthias Dehmer
JACM
2000
131views more  JACM 2000»
13 years 9 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle