Sciweavers

16257 search results - page 120 / 3252
» D-finiteness: algorithms and applications
Sort
View
AAECC
2008
Springer
83views Algorithms» more  AAECC 2008»
14 years 10 months ago
Fast separable factorization and applications
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
Grégoire Lecerf
EOR
2010
103views more  EOR 2010»
14 years 10 months ago
Exploiting special structure in semidefinite programming: A survey of theory and applications
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...
Etienne de Klerk
IPL
2008
111views more  IPL 2008»
14 years 10 months ago
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
Markus Bläser, Thomas Heynen, Bodo Manthey
PRL
2006
191views more  PRL 2006»
14 years 10 months ago
Applications of hidden Markov models in bar code decoding
We present a novel approach to edge detection in bar code signals using a hidden Markov model (HMM). We also present an algorithm for selection of an optimal filter scale used in ...
S. Kresic-Juric, D. Madej, Fadil Santosa
SPAA
2010
ACM
14 years 10 months ago
Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures
We present a scheduling algorithm of stream programs for multi-core architectures called team scheduling. Compared to previous multi-core stream scheduling algorithms, team schedu...
JongSoo Park, William J. Dally