Sciweavers

370 search results - page 37 / 74
» Mathematical Symbol Indexing
Sort
View
EWMF
2005
Springer
15 years 3 months ago
Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
Abstract. We show that eigenvector decomposition can be used to extract a term taxonomy from a given collection of text documents. So far, methods based on eigenvector decompositio...
Holger Bast, Georges Dupret, Debapriyo Majumdar, B...
DCC
2005
IEEE
15 years 9 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
DAS
2010
Springer
15 years 1 months ago
Improved classification through runoff elections
We consider the problem of dealing with irrelevant votes when a multi-case classifier is built from an ensemble of binary classifiers. We show how run-off elections can be used to...
Oleg Golubitsky, Stephen M. Watt
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
15 years 3 months ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
15 years 3 months ago
Lifting techniques for triangular decompositions
We present lifting techniques for triangular decompositions of zero-dimensional varieties, that extend the range of the previous methods. We discuss complexity aspects, and report...
Xavier Dahan, Marc Moreno Maza, Éric Schost...