Sciweavers

2040 search results - page 205 / 408
» Approximate Expectation Maximization
Sort
View
126
Voted
COLT
2005
Springer
15 years 9 months ago
Margin-Based Ranking Meets Boosting in the Middle
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
Cynthia Rudin, Corinna Cortes, Mehryar Mohri, Robe...
110
Voted
CAAN
2004
Springer
15 years 9 months ago
Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...
Sung-woo Cho, Ashish Goel
125
Voted
ECML
2003
Springer
15 years 9 months ago
Robust k-DNF Learning via Inductive Belief Merging
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
Frédéric Koriche, Joël Quinquet...
122
Voted
RTSS
2000
IEEE
15 years 8 months ago
An Incremental Approach to Scheduling during Overloads in Real-Time Systems
In this paper we propose a novel scheduling framework for a real-timeenvironmentthat experiences dynamic changes. Thisframework is capable of adjusting the system workload in incr...
Pedro Mejía-Alvarez, Rami G. Melhem, Daniel...
143
Voted
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 7 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...