Sciweavers

332 search results - page 62 / 67
» An Aristotelian notion of size
Sort
View
JAIR
2007
95views more  JAIR 2007»
14 years 9 months ago
Consistency and Random Constraint Satisfaction Models
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
Yong Gao, Joseph C. Culberson
JCS
2007
80views more  JCS 2007»
14 years 9 months ago
Secure information flow for a concurrent language with scheduling
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have specified an information flow ty...
Gilles Barthe, Leonor Prensa Nieto
COMBINATORICS
2000
63views more  COMBINATORICS 2000»
14 years 9 months ago
A Ramsey Treatment of Symmetry
Given a space endowed with symmetry, we define ms(, r) to be the maximum of m such that for any r-coloring of there exists a monochromatic symmetric set of size at least m. We c...
Taras O. Banakh, O. V. Verbitsky, Ya. Vorobets
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 1 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
DLT
2007
14 years 11 months ago
Two Element Unavoidable Sets of Partial Words
d Abstract) F. Blanchet-Sadri1 , N.C. Brownstein2 , and Justin Palumbo3 1 Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402–6170,...
Francine Blanchet-Sadri, N. C. Brownstein, Justin ...