Sciweavers

1225 search results - page 54 / 245
» Maximal Consistent Subsets
Sort
View
KDD
2005
ACM
135views Data Mining» more  KDD 2005»
14 years 8 months ago
A hybrid unsupervised approach for document clustering
We propose a hybrid, unsupervised document clustering approach that combines a hierarchical clustering algorithm with Expectation Maximization. We developed several heuristics to ...
Mihai Surdeanu, Jordi Turmo, Alicia Ageno
SODA
2010
ACM
163views Algorithms» more  SODA 2010»
14 years 5 months ago
Geometric optimization and sums of algebraic functions
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
Antoine Vigneron
ICASSP
2008
IEEE
14 years 2 months ago
Maximum entropy relaxation for multiscale graphical model selection
We consider the problem of learning multiscale graphical models. Given a collection of variables along with covariance specifications for these variables, we introduce hidden var...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
TABLEAUX
2007
Springer
14 years 1 months ago
Axiom Pinpointing in General Tableaux
Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing ...
Franz Baader, Rafael Peñaloza
COCOON
2005
Springer
14 years 1 months ago
A PTAS for a Disc Covering Problem Using Width-Bounded Separators
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu