Sciweavers

536 search results - page 28 / 108
» Some Lower Bounds for the Complexity of Continuation Methods
Sort
View
CVPR
2010
IEEE
14 years 4 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
DATE
2003
IEEE
116views Hardware» more  DATE 2003»
14 years 1 months ago
Statistical Timing Analysis Using Bounds
The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing anal...
Aseem Agarwal, David Blaauw, Vladimir Zolotov, Sar...
TCOM
2008
130views more  TCOM 2008»
13 years 8 months ago
Quasi-orthogonal STBC with minimum decoding complexity: performance analysis, optimal signal transformations, and antenna select
This letter presents a new method to directly analyze and optimize symbol error rate (SER) performance of minimum decoding complexity (MDC) ABBA space-time block codes based on a t...
Dung Ngoc Dao, Chintha Tellambura
ICRA
2008
IEEE
127views Robotics» more  ICRA 2008»
14 years 2 months ago
Continuous control law from unilateral constraints
— The control approaches based on tasks, and particularly based on a hierarchy of tasks, enable to build complex behaviors with some nice properties of robustness and portability...
Nicolas Mansard, Oussama Khatib
ICASSP
2011
IEEE
13 years 5 days ago
Interference alignment in single-beam MIMO networks via homotopy continuation
In this paper we consider the application of a homotopy-continuation based method for finding interference alignment (IA) solutions for the deterministic K-user multiple-input mu...
Oscar Gonzalez, Ignacio Santamaría