Sciweavers

409 search results - page 68 / 82
» Polynomial Time Approximation Schemes and Parameterized Comp...
Sort
View
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 9 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...
WWW
2008
ACM
15 years 10 months ago
Externalities in online advertising
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
Arpita Ghosh, Mohammad Mahdian
ICC
2007
IEEE
303views Communications» more  ICC 2007»
15 years 4 months ago
Frequency Domain Channel Estimation for OFDM Based on Slepian Basis Expansion
Abstract—In this paper we propose a low complexity frequency domain channel estimator for pilot-symbol-assisted (PSA) orthogonal frequency division multiplexing (OFDM) systems in...
Jinho Kim, Chih-Wei Wang, Wayne E. Stark
FOCS
2002
IEEE
15 years 2 months ago
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
Andrej Bogdanov, Kenji Obata, Luca Trevisan
PIMRC
2010
IEEE
14 years 7 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