Sciweavers

1538 search results - page 115 / 308
» Relative Randomness and Cardinality
Sort
View
TREC
2007
14 years 11 months ago
University of Twente at the TREC 2007 Enterprise Track: Modeling Relevance Propagation for the Expert Search Task
This paper describes several approaches which we used for the expert search task of the TREC 2007 Enterprise track. We studied several methods of relevance propagation from docume...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
PAMI
1998
86views more  PAMI 1998»
14 years 9 months ago
Spatial Sampling of Printed Patterns
—The bitmap obtained by scanning a printed pattern depends on the exact location of the scanning grid relative to the pattern. We consider ideal sampling with a regular lattice o...
Prateek Sarkar, George Nagy, Jiangying Zhou, Danie...
WIOPT
2011
IEEE
14 years 1 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
15 years 4 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
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
15 years 10 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs