Sciweavers

2570 search results - page 103 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Proportionate affine projection sign algorithms for sparse system identification in impulsive interference
Two proportionate af ne projection sign algorithms (APSAs) are proposed for system identi cation applications, such as network echo cancellation (NEC), where the impulse response ...
Zengli Yang, Yahong Rosa Zheng, Steven L. Grant
DAC
2004
ACM
15 years 11 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay
81
Voted
SCA
2007
15 years 15 days ago
Adaptive deformations with fast tight bounds
Simulation of deformations and collision detection are two highly intertwined problems that are often treated separately. This is especially true in existing elegant adaptive simu...
Miguel A. Otaduy, Daniel Germann, Stephane Redon, ...
CORR
2011
Springer
175views Education» more  CORR 2011»
14 years 5 months ago
A Matrix Hyperbolic Cosine Algorithm and Applications
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
Anastasios Zouzias
CP
2011
Springer
13 years 10 months ago
Algorithm Selection and Scheduling
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, ...