Sciweavers

79 search results - page 3 / 16
» The Last Fraction of a Fractional Conjecture
Sort
View
GROUP
2009
ACM
13 years 12 months ago
Wikipedians are born, not made: a study of power editors on Wikipedia
Open content web sites depend on users to produce information of value. Wikipedia is the largest and most well-known such site. Previous work has shown that a small fraction of ed...
Katherine A. Panciera, Aaron Halfaker, Loren G. Te...
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
14 years 5 months ago
Reimer's inequality and tardos' conjecture
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
Clifford D. Smyth
ARSCOM
2008
78views more  ARSCOM 2008»
13 years 5 months ago
Three challenges in Costas arrays
We present 3 open challenges in the field of Costas arrays. They are: a) the determination of the number of dots on the main diagonal of a Welch array, and especially the maximal ...
Konstantinos Drakakis
EUROCRYPT
1987
Springer
13 years 9 months ago
Sequences With Almost Perfect Linear Complexity Profile
Sequences with almost perfect linear complexity profile are defined by H. Niederreiter[4]. C.P. Xing and K.Y. Lam[5, 6] extended this concept from the case of single sequences to ...
Harald Niederreiter
DAM
2007
97views more  DAM 2007»
13 years 5 months ago
On Sturmian graphs
In this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conj...
Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit,...