Sciweavers

17770 search results - page 83 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
SODA
2003
ACM
138views Algorithms» more  SODA 2003»
14 years 11 months ago
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...
Hung Q. Ngo, Van H. Vu
ADCM
2007
168views more  ADCM 2007»
14 years 10 months ago
A generalization of Gram-Schmidt orthogonalization generating all Parseval frames
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...
Peter G. Casazza, Gitta Kutyniok
ENTCS
2006
137views more  ENTCS 2006»
14 years 9 months ago
Coinductive Field of Exact Real Numbers and General Corecursion
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...
Milad Niqui
SAT
2009
Springer
82views Hardware» more  SAT 2009»
15 years 4 months ago
Generalizing Core-Guided Max-SAT
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...
Mark H. Liffiton, Karem A. Sakallah
ESA
2010
Springer
163views Algorithms» more  ESA 2010»
14 years 11 months ago
On the Huffman and Alphabetic Tree Problem with General Cost Functions
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...
Hiroshi Fujiwara, Tobias Jacobs