649 search results - page 57 / 130 » An Improved Construction of Progression-Free Sets |
WAIM
2007
Springer
15 years 6 months ago
2007
Springer
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
133
click to vote
EMNLP
2011
14 years 8 days ago
2011
This paper describes a novel approach to the semantic relation detection problem. Instead of relying only on the training instances for a new relation, we leverage the knowledge l...
102
Voted
STOC
2003
ACM
16 years 25 days ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
106
Voted
EUROCRYPT
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
97
Voted
HYBRID
2010
Springer
15 years 7 months ago
2010
Springer
This paper is concerned with reachable set computation for non-linear systems using hybridization. The essence of hybridization is to approximate a non-linear vector field by a s...