17760 search results - page 60 / 3552 » A Generalization of the Massey-Ding Algorithm |
116
click to vote
ADCM
2007
15 years 1 months ago
2007
Given an arbitrary finite sequence of vectors in a finite–dimensional Hilbert space, we describe an algorithm, which computes a Parseval frame for the subspace generated by the...
103
click to vote
ENTCS
2006
15 years 1 months ago
2006
In this article we present a method to define algebraic structure (field operations) on a representation of real numbers by coinductive streams. The field operations will be given...
102
click to vote
SAT
2009
Springer
15 years 8 months ago
2009
Springer
Recent work has shown the value of using unsatisfiable cores to guide maximum satisfiability algorithms (Max-SAT) running on industrial instances [5,9,10,11]. We take this concep...
ESA
2010
Springer
15 years 2 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
100
click to vote
COMPUTING
2007
15 years 1 months ago
2007
In this paper a class of subdivision schemes generalizing the algorithm of Loop is presented. The stencils have the same support as those from the algorithm of Loop, but allow a v...