Sciweavers

57 search results - page 4 / 12
» On Characterization of Entropy Function via Information Ineq...
Sort
View
AMC
2005
112views more  AMC 2005»
13 years 8 months ago
Stieltjes moment problem via fractional moments
Stieltjes moment problem is considered to recover a probability density function from the knowledge of its infinite sequence of ordinary moments. The approximate density is obtain...
Pierluigi Novi Inverardi, Alberto Petri, Giorgio P...
CDC
2008
IEEE
14 years 3 months ago
Weight selection for gap robustness with degree-constrained controllers
— In modern robust control, control synthesis may be cast as an interpolation problem where the interpolant relates to robustness and performance criteria. In particular, robustn...
Johan Karlsson, Tryphon T. Georgiou, Anders Lindqu...
ICML
2005
IEEE
14 years 9 months ago
Q-learning of sequential attention for visual object recognition from informative local descriptors
This work provides a framework for learning sequential attention in real-world visual object recognition, using an architecture of three processing stages. The first stage rejects...
Lucas Paletta, Gerald Fritz, Christin Seifert
PODC
2006
ACM
14 years 2 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
ICALP
2003
Springer
14 years 1 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen