Sciweavers

1004 search results - page 157 / 201
» Product representations of polynomials
Sort
View
SIGIR
2008
ACM
14 years 11 months ago
Learning query intent from regularized click graphs
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
Xiao Li, Ye-Yi Wang, Alex Acero
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 4 days ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
FOCS
2009
IEEE
15 years 6 months ago
Linear Systems over Composite Moduli
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
Arkadev Chattopadhyay, Avi Wigderson
68
Voted
ATAL
2009
Springer
15 years 6 months ago
Combinatorial prediction markets for event hierarchies
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
Mingyu Guo, David M. Pennock
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
15 years 6 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman