Sciweavers

1399 search results - page 51 / 280
» New Algorithms for k-Center and Extensions
Sort
View
ECML
2001
Springer
14 years 1 months ago
A Framework for Learning Rules from Multiple Instance Data
Abstract. This paper proposes a generic extension to propositional rule learners to handle multiple-instance data. In a multiple-instance representation, each learning example is r...
Yann Chevaleyre, Jean-Daniel Zucker
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
14 years 1 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
ECML
2006
Springer
14 years 26 days ago
Automatically Evolving Rule Induction Algorithms
Research in the rule induction algorithm field produced many algorithms in the last 30 years. However, these algorithms are usually obtained from a few basic rule induction algorit...
Gisele L. Pappa, Alex Alves Freitas
ICML
2008
IEEE
14 years 10 months ago
Estimating local optimums in EM algorithm over Gaussian mixture model
EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is no...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
13 years 10 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...