Sciweavers

4998 search results - page 747 / 1000
» The case for intentional networking
Sort
View
DICTA
2009
13 years 10 months ago
Dense Correspondence Extraction in Difficult Uncalibrated Scenarios
Abstract--The relationship between multiple cameras viewing the same scene may be discovered automatically by finding corresponding points in the two views and then solving for the...
Ruan Lakemond, Clinton Fookes, Sridha Sridharan
GECCO
2008
Springer
159views Optimization» more  GECCO 2008»
13 years 10 months ago
IGAP: interactive genetic algorithm peer to peer
We present IGAP, a peer to peer interactive genetic algorithm which reflects the real world methodology followed in team design. We apply our methodology to floorplanning. Throu...
Juan C. Quiroz, Amit Banerjee, Sushil J. Louis
COMCOM
2010
150views more  COMCOM 2010»
13 years 9 months ago
Convergence of trajectories and optimal buffer sizing for MIMD congestion control
We study the interaction between the MIMD (Multiplicative Increase Multiplicative Decrease) congestion control and a bottleneck router with Drop Tail buffer. We consider the probl...
Yi Zhang, Alexei B. Piunovskiy, Urtzi Ayesta, Kons...
CORR
2008
Springer
158views Education» more  CORR 2008»
13 years 9 months ago
Distributed and Recursive Parameter Estimation in Parametrized Linear State-Space Models
We consider a network of sensors deployed to sense a spatio-temporal field and infer parameters of interest about the field. We are interested in the case where each sensor's...
S. Sundhar Ram, Venugopal V. Veeravalli, Angelia N...
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 9 months ago
Rate and power allocation under the pairwise distributed source coding constraint
We explore the problem of rate and power allocation for a sensor network where pairwise distributed source coding is employed (introduced by Roumy and Gesbert `07). For noiseless n...
Shizheng Li, Aditya Ramamoorthy