Sciweavers

892 search results - page 26 / 179
» An efficient terminal and model order reduction algorithm
Sort
View
ACL
2010
13 years 7 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
HAIS
2009
Springer
14 years 7 days ago
A First Study on the Use of Coevolutionary Algorithms for Instance and Feature Selection
Abstract. Cooperative Coevolution is a technique in the area of Evolutionary Computation. It has been applied to many combinatorial problems with great success. This contribution p...
Joaquín Derrac, Salvador García, Fra...
GLVLSI
2009
IEEE
172views VLSI» more  GLVLSI 2009»
14 years 26 days ago
Contact merging algorithm for efficient substrate noise analysis in large scale circuits
A methodology is proposed to efficiently estimate the substrate noise generated by large scale aggressor circuits. Small spatial voltage differences within the ground distribution...
Emre Salman, Renatas Jakushokas, Eby G. Friedman, ...
ICIP
1998
IEEE
14 years 10 months ago
An Efficient Motion Estimation Algorithm based on Tracing Techniques on Large Search Windows
Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
Marco Mattavelli, Giorgio Zoia
AIPS
2008
13 years 11 months ago
A New Probabilistic Plan Recognition Algorithm Based on String Rewriting
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...
Christopher W. Geib, John Maraist, Robert P. Goldm...