20 search results - page 1 / 4 » An upper bound on the average size of silhouettes |
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides,...
EUROCRYPT
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
TIT
2008
13 years 5 months ago
2008
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
CPM
2009
Springer
13 years 6 months ago
2009
Springer
Factor and suffix oracles have been introduced in [1] in order to provide an economic and efficient solution for storing all the factors and suffixes respectively of a given text. ...