Sciweavers

400 search results - page 3 / 80
» An Algorithm for the Reduction of Linear DAE
Sort
View
ACL
2010
13 years 6 months ago
Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
Benoît Sagot, Giorgio Satta
INTEGRATION
2008
101views more  INTEGRATION 2008»
13 years 8 months ago
An efficient terminal and model order reduction algorithm
The paper proposes an efficient terminal and model order reduction method for compact modeling of interconnect circuits with many terminals. The new method is inspired by the rece...
Pu Liu, Sheldon X.-D. Tan, Boyuan Yan, Bruce McGau...
PAKDD
2010
ACM
173views Data Mining» more  PAKDD 2010»
13 years 6 months ago
Distributed Knowledge Discovery with Non Linear Dimensionality Reduction
Data mining tasks results are usually improved by reducing the dimensionality of data. This improvement however is achieved harder in the case that data lay on a non linear manifol...
Panagis Magdalinos, Michalis Vazirgiannis, Dialect...
ARITH
2005
IEEE
14 years 2 months ago
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
Dhananjay S. Phatak, Tom Goff
COCOON
2006
Springer
14 years 11 days ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng