Sciweavers

2432 search results - page 15 / 487
» Degrees and choice numbers
Sort
View
COMBINATORICS
2007
75views more  COMBINATORICS 2007»
15 years 6 months ago
Maximal Projective Degrees for Strict Partitions
Let λ be a partition, and denote by fλ the number of standard tableaux of shape λ. The asymptotic shape of λ maximizing fλ was determined in the classical work of Logan and S...
D. Bernstein, A. Henke, A. Regev
FOCS
2009
IEEE
16 years 24 days ago
Choice-Memory Tradeoff in Allocations
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich
ACSAC
2004
IEEE
15 years 9 months ago
Towards Secure Design Choices for Implementing Graphical Passwords
We study the impact of selected parameters on the size of the password space for "Draw-A-Secret" (DAS) graphical passwords. We examine the role of and relationships betw...
Julie Thorpe, Paul C. van Oorschot
ACL
2010
15 years 4 months ago
Vocabulary Choice as an Indicator of Perspective
We establish the following characteristics of the task of perspective classification: (a) using term frequencies in a document does not improve classification achieved with absenc...
Beata Beigman Klebanov, Eyal Beigman, Daniel Dierm...
ENDM
2002
109views more  ENDM 2002»
15 years 5 months ago
Graph Operations and Zipfian Degree Distributions
The probability distribution on a set S = { 1, 2, . . . , n } defined by Pr(k) = 1/(Hnk), where Hn in the nth harmonic number, is commonly called a Zipfian distribution. In this no...
Walter W. Kirchherr