Sciweavers

318 search results - page 30 / 64
» On the equivalence of linear complementarity problems
Sort
View
JSAC
2008
70views more  JSAC 2008»
13 years 7 months ago
LMMSE turbo equalization based on factor graphs
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
Qinghua Guo, Li Ping
ICIP
2005
IEEE
14 years 9 months ago
The impulse responses of block shift-invariant systems and their use for demosaicing algorithms
Shift-invariant linear algorithms can be described completely by the algorithm's response to an impulse input. The so called impulse response can be used as filter kernels wh...
Yacov Hel-Or
JCO
2011
63views more  JCO 2011»
12 years 10 months ago
Robust multi-sensor scheduling for multi-site surveillance
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
Nikita Boyko, Timofey Turko, Vladimir Boginski, Da...
EUROCRYPT
2008
Springer
13 years 9 months ago
Key Recovery on Hidden Monomial Multivariate Schemes
Abstract. The problem we study in this paper is the key recovery problem on the C schemes and generalizations where the quadratic monomial of C (the product of two linear monomials...
Pierre-Alain Fouque, Gilles Macario-Rat, Jacques S...
FSTTCS
2005
Springer
14 years 1 months ago
When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
Béatrice Bérard, Franck Cassez, Serg...