148 search results - page 16 / 30 » Formally Analyzing Expected Time Complexity of Algorithms Us... |
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
VIS
2007
IEEE
14 years 8 months ago
2007
IEEE
Pipeline architectures provide a versatile and efficient mechanism for constructing visualizations, and they have been implemented in numerous libraries and applications over the p...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
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...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...