Sciweavers

933 search results - page 6 / 187
» Monotone Complexity of a Pair
Sort
View
DM
2006
73views more  DM 2006»
13 years 7 months ago
Composition of Post classes and normal forms of Boolean functions
The class composition C K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f C, g1, . . . , gn K, is investigated. This composition C K is either...
Miguel Couceiro, Stephan Foldes, Erkko Lehtonen
MSS
2011
IEEE
159views Hardware» more  MSS 2011»
12 years 11 months ago
Reversals of signal-posterior monotonicity for any bounded prior
Paul Milgrom (The Bell Journal of Economics, 12(2): 380–391) showed that if the strict monotone likelihood ratio property (MLRP) does not hold for a conditional distribution the...
Christopher P. Chambers, Paul J. Healy
ICALP
2001
Springer
13 years 12 months ago
Improved Lower Bounds on the Randomized Complexity of Graph Properties
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
Amit Chakrabarti, Subhash Khot
MOR
2010
98views more  MOR 2010»
13 years 5 months ago
Sharing the Cost of a Capacity Network
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
Anna Bogomolnaia, Ron Holzman, Hervé Moulin
DIS
2003
Springer
14 years 20 days ago
Extraction of Coverings as Monotone DNF Formulas
Abstract. In this paper, we extend monotone monomials as large itemsets in association rule mining to monotone DNF formulas. First, we introduce not only the minimum support but al...
Kouichi Hirata, Ryosuke Nagazumi, Masateru Harao