Sciweavers

400 search results - page 13 / 80
» An Algorithm for the Reduction of Linear DAE
Sort
View
DAC
1997
ACM
14 years 25 days ago
An Improved Algorithm for Minimum-Area Retiming
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
Naresh Maheshwari, Sachin S. Sapatnekar
GD
2005
Springer
14 years 2 months ago
Non-planar Core Reduction of Graphs
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
Carsten Gutwenger, Markus Chimani
ICPR
2008
IEEE
14 years 3 months ago
Clustering-based locally linear embedding
The locally linear embedding (LLE) algorithm is considered as a powerful method for the problem of nonlinear dimensionality reduction. In this paper, first, a new method called cl...
Kanghua Hui, Chunheng Wang
WSC
2000
13 years 10 months ago
Variance reduction techniques for value-at-risk with heavy-tailed risk factors
The calculation of value-at-risk (VAR) for large portfolios of complex instruments is among the most demanding and widespread computational challenges facing the financial industr...
Paul Glasserman, Philip Heidelberger, Perwez Shaha...
ECML
2005
Springer
14 years 2 months ago
Fast Non-negative Dimensionality Reduction for Protein Fold Recognition
Abstract. In this paper, dimensionality reduction via matrix factorization with nonnegativity constraints is studied. Because of these constraints, it stands apart from other linea...
Oleg Okun, Helen Priisalu, Alexessander Alves