526 search results - page 15 / 106 » On the Number of Minimal Addition Chains |
73
Voted
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
77
Voted
LREC
2010
14 years 11 months ago
2010
The recent availability of large collections of text such as the Google 1T 5-gram corpus (Brants and Franz, 2006) and the Gigaword corpus of newswire (Graff, 2003) have made it po...
WEA
2007
Springer
15 years 3 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
PPOPP
2006
ACM
15 years 3 months ago
2006
ACM
Recently, the high-performance computing community has realized that power is a performance-limiting factor. One reason for this is that supercomputing centers have limited power ...
CIARP
2004
Springer
15 years 3 months ago
2004
Springer
One of the most important steps in text processing and information retrieval is stemming—reducing of words to stems expressing their base meaning, e.g., bake, baked, bakes, bakin...