Sciweavers

166 search results - page 27 / 34
» Resultants of partially composed polynomials
Sort
View
PIMRC
2010
IEEE
13 years 5 months ago
Fast varying channel estimation in downlink LTE systems
This paper tackles the problem of fast varying channel estimation in LTE systems. Particular attention is given to downlink transmission where OFDMA is used as the multiple access ...
Youssef El Hajj Shehadeh, Serdar Sezginer
FOCM
2011
90views more  FOCM 2011»
12 years 11 months ago
Hamiltonian Interpolation of Splitting Approximations for Nonlinear PDEs
We consider a wide class of semi linear Hamiltonian partial differential equations and their approximation by time splitting methods. We assume that the nonlinearity is polynomia...
Erwan Faou, Benoît Grebert
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
IACR
2011
128views more  IACR 2011»
12 years 7 months ago
Sign Modules in Secure Arithmetic Circuits
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
Ching-Hua Yu
FOCS
2007
IEEE
14 years 1 months ago
The Power of Quantum Systems on a Line
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
Dorit Aharonov, Daniel Gottesman, Sandy Irani, Jul...