Sciweavers

1169 search results - page 2 / 234
» Degrees of monotone complexity
Sort
View
MFCS
2005
Springer
13 years 10 months ago
Complexity of DNF and Isomorphism of Monotone Formulas
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
Judy Goldsmith, Matthias Hagen, Martin Mundhenk
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
14 years 2 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
IPL
2011
131views more  IPL 2011»
13 years 2 days ago
The regularized least squares algorithm and the problem of learning halfspaces
We provide sample complexity of the problem of learning halfspaces with monotonic noise, using the regularized least squares algorithm in the reproducing kernel Hilbert spaces (RKH...
Ha Quang Minh
RTAS
1995
IEEE
13 years 8 months ago
A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks
The rate monotonic scheduling algorithm is a commonly used task scheduling algorithm for periodic realtime task systems. This paper discusses feasibility decision for a given real...
Yoshifumi Manabe, Shigemi Aoyagi
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
13 years 8 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó