434 search results - page 7 / 87 » sum 2007 |
137
click to vote
EACL
2009
ACL Anthology
16 years 5 months ago
2009
ACL Anthology
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
144
Voted
TLCA
2007
Springer
15 years 11 months ago
2007
Springer
Inspired by recent work on normalisation by evaluation for sums, we propose a normalising and confluent extensional rewriting theory for the simply-typed λ-calculus extended with...
129
click to vote
ALGORITHMICA
2006
15 years 5 months ago
2006
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
103
Voted
ARSCOM
2007
15 years 5 months ago
2007
For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l+ : V (G) → Zh defined by l+ ...
146
click to vote
AUSDM
2007
Springer
15 years 9 months ago
2007
Springer
This research presents a classifier that aims to provide insight into a dataset in addition to achieving classification accuracies comparable to other algorithms. The classifier c...