Sciweavers

2069 search results - page 158 / 414
» Linear time algorithms for Clobber
Sort
View
COMPGEOM
1992
ACM
15 years 8 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl
141
Voted
SPIN
2004
Springer
15 years 10 months ago
Minimization of Counterexamples in SPIN
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
Paul Gastin, Pierre Moro, Marc Zeitoun
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
15 years 3 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
ICASSP
2011
IEEE
14 years 8 months ago
Simplified EM channel estimation in LTE systems
In this paper, an iterative channel estimation algorithm is considered in LTE systems. A simplified expectation maximization (EM) based algorithm is proposed for channel estimati...
Yang Liu, Serdar Sezginer
ISBI
2004
IEEE
16 years 5 months ago
Incremental Activation Detection in fMRI Series Using Kalman Filtering
We propose a new detection algorithm for functional magnetic resonance imaging (fMRI) data. Our basic idea is to use an extended Kalman filter (EKF) to fit a general linear model ...
Alexis Roche, Jean-Baptiste Poline, Pierre-Jean La...