Sciweavers

1197 search results - page 191 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
CDC
2009
IEEE
155views Control Systems» more  CDC 2009»
14 years 2 days ago
Efficient and robust communication topologies for distributed decision making in networked systems
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
John S. Baras, Pedram Hovareshti
ECCV
2002
Springer
14 years 10 months ago
Constructing Illumination Image Basis from Object Motion
We propose to construct a 3D linear image basis which spans an image space of arbitrary illumination conditions, from images of a moving object observed under a static lighting con...
Akiko Nakashima, Atsuto Maki, Kazuhiro Fukui
ICASSP
2008
IEEE
14 years 2 months ago
Least-squares design of subsampled allpass transformed DFT filter-banks with LTI property
A new design approach for an allpass transformed analysis-synthesis filter-bank (AS FB) with subsampling is proposed, which can be used for adaptive subband processing with non-u...
Heinrich W. Löllmann, Guido Dartmann, Peter V...
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
13 years 12 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
TIT
2008
74views more  TIT 2008»
13 years 8 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf