397 search results - page 66 / 80 » Pseudorandom Functions and Lattices |
150
click to vote
FSE
2008
Springer
15 years 7 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
176
click to vote
EMNLP
2008
15 years 7 months ago
2008
Minimum Error Rate Training (MERT) is an effective means to estimate the feature function weights of a linear model such that an automated evaluation criterion for measuring syste...
171
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
272
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
156
click to vote
ICC
2007
IEEE
16 years 10 days ago
2007
IEEE
— We consider combination of Distributed Source Coding (DSC) and cooperative transmission techniques to improve energy efficiency in sensor networks. To start with we formulate ...