202 search results - page 15 / 41 » sum 2009 |
183
click to vote
TSD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This paper suggests a novel representation for documents that is intended to improve precision. This representation is generated by combining two central techniques: Rand...
156
click to vote
ECCC
2007
15 years 6 months ago
2007
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
149
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Most existing work on Privacy-Preserving Data Mining (PPDM) focus on enabling conventional data mining algorithms with the ability to run in a secure manner in a multi-party setti...
195
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
171
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...