4171 search results - page 24 / 835 » Choice numbers of graphs |
JAIR
2011
13 years 3 months ago
2011
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
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 ...
ACSAC
2004
IEEE
14 years 7 days ago
2004
IEEE
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...
ACL
2010
13 years 6 months ago
2010
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...
NETWORKS
2008
13 years 8 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...