185 search results - page 4 / 37 » Constructions of Grassmannian Simplices |
82
Voted
EUROCRYPT
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. In this paper we present a simpler construction of a publickey encryption scheme that achieves adaptive chosen ciphertext security (CCA2), assuming the existence of trapd...
EXPERT
1998
14 years 9 months ago
1998
Constructive induction divides the problem of learning an inductive hypothesis into two intertwined searches: one—for the “best” representation space, and two—for the “be...
FOCS
1990
IEEE
15 years 2 months ago
1990
IEEE
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
PDCAT
2007
Springer
15 years 4 months ago
2007
Springer
The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks (INs) in such supercomputers play an important role. ...
131
click to vote
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...