Sciweavers

454 search results - page 21 / 91
» Segmented Iterators and Hierarchical Algorithms
Sort
View
94
Voted
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
14 years 11 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
KDD
2009
ACM
160views Data Mining» more  KDD 2009»
15 years 4 months ago
Clustering event logs using iterative partitioning
The importance of event logs, as a source of information in systems and network management cannot be overemphasized. With the ever increasing size and complexity of today’s even...
Adetokunbo Makanju, A. Nur Zincir-Heywood, Evangel...
CVPR
2000
IEEE
15 years 11 months ago
Fast Multiscale Image Segmentation
We introduce a fast, multiscale algorithm for image segmentation. Our algorithm uses modern numeric techniques to nd an approximate solution to normalized cut measures in time tha...
Eitan Sharon, Achi Brandt, Ronen Basri
PAMI
2002
127views more  PAMI 2002»
14 years 9 months ago
Relative Fuzzy Connectedness and Object Definition: Theory, Algorithms, and Applications in Image Segmentation
The notion of fuzzy connectedness captures the idea of "hanging-togetherness" of image elements in an object by assigning a strength of connectedness to every possible pa...
Jayaram K. Udupa, Punam K. Saha, Roberto de Alenca...
78
Voted
KDD
2005
ACM
135views Data Mining» more  KDD 2005»
15 years 10 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