Sciweavers

431 search results - page 2 / 87
» Implementing the maximum of monotone algorithms
Sort
View
NIPS
1998
13 years 10 months ago
Maximum Conditional Likelihood via Bound Maximization and the CEM Algorithm
We present the CEM (Conditional Expectation Maximization) algorithm as an extension of the EM (Expectation Maximization) algorithm to conditional density estimation under missing ...
Tony Jebara, Alex Pentland
DIS
2003
Springer
14 years 2 months 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
MOBIHOC
2002
ACM
14 years 9 months ago
Algorithmic aspects of topology control problems for ad hoc networks
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ra...
SIAMJO
2008
79views more  SIAMJO 2008»
13 years 9 months ago
A Class of Inexact Variable Metric Proximal Point Algorithms
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
Lisandro A. Parente, Pablo A. Lotito, Mikhail V. S...
RTSS
1999
IEEE
14 years 1 months ago
Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and...
Alia Atlas, Azer Bestavros