Sciweavers

1197 search results - page 149 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
ICCAD
2004
IEEE
125views Hardware» more  ICCAD 2004»
14 years 5 months ago
Temporal floorplanning using the T-tree formulation
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
ICCV
2009
IEEE
1957views Computer Vision» more  ICCV 2009»
15 years 1 months ago
Robust Visual Tracking using L1 Minimization
In this paper we propose a robust visual tracking method by casting tracking as a sparse approximation problem in a particle filter framework. In this framework, occlusion, corru...
Xue Mei, Haibin Ling
ICC
2008
IEEE
168views Communications» more  ICC 2008»
14 years 2 months ago
Topology Control for Reliable Sensor-to-Sink Data Transport in Sensor Networks
— Wireless Sensor Networks (WSNs) are generally used for harsh environments involving military surveillance, emergency response, and habitat monitoring. Due to severe resource co...
Jiong Wang, Sirisha Medidi
ICML
2010
IEEE
13 years 9 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
ATAL
2010
Springer
13 years 9 months ago
Cultivating desired behaviour: policy teaching via environment-dynamics tweaks
In this paper we study, for the first time explicitly, the implications of endowing an interested party (i.e. a teacher) with the ability to modify the underlying dynamics of the ...
Zinovi Rabinovich, Lachlan Dufton, Kate Larson, Ni...