Sciweavers

614 search results - page 16 / 123
» Computational Complexity of Multi-way, Dataflow Constraint P...
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
Tracking Multiple People under Global Appearance Constraints
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exp...
Horesh Ben Shitrit, Jerome Berclaz, Francois Fleur...
ICASSP
2011
IEEE
12 years 11 months ago
A convex approximation approach to weighted sum rate maximization of multiuser MISO interference channel under outage constraint
This paper considers weighted sum rate maximization of multiuser multiple-input single-output interference channel (MISO-IFC) under outage constraints. The outage-constrained weig...
Wei-Chiang Li, Tsung-Hui Chang, Che Lin, Chong-Yun...
FDL
2004
IEEE
13 years 11 months ago
A Functional Programming Framework of Heterogeneous Model of Computation for System Design
System-on-Chip (SOC) and other complex distributed hardware/software systems contain heterogeneous components such as DSPs, micro-controllers, application specific logic etc., whi...
Deepak Mathaikutty, Hiren D. Patel, Sandeep K. Shu...
TMC
2008
127views more  TMC 2008»
13 years 7 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
CVPR
2005
IEEE
14 years 9 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...