Sciweavers

230 search results - page 20 / 46
» Faster algorithms for the characteristic polynomial
Sort
View
CORR
2007
Springer
115views Education» more  CORR 2007»
14 years 9 months ago
Q-adic Transform revisited
We present an algorithm to perform a simultaneous modular reduction of several residues. This enables to compress polynomials into integers and perform several modular operations ...
Jean-Guillaume Dumas
CSL
2010
Springer
14 years 10 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
ICPR
2010
IEEE
14 years 8 months ago
Incremental Training of Multiclass Support Vector Machines
We present a new method for the incremental training of multiclass Support Vector Machines that provides computational efficiency for training problems in the case where the trai...
Symeon Nikitidis, Nikos Nikolaidis, Ioannis Pitas
57
Voted
ASPDAC
2005
ACM
109views Hardware» more  ASPDAC 2005»
14 years 11 months ago
BDD-based two variable sharing extraction
It has been shown that Binary Decision Diagram (BDD) based logic synthesis enjoys faster runtime than the classic logic synthesis systems based on Sum of Product (SOP) form. Howev...
Dennis Wu, Jianwen Zhu
RSA
2010
98views more  RSA 2010»
14 years 8 months ago
Network delay inference from additive metrics
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...
Shankar Bhamidi, Ram Rajagopal, Sébastien R...