Sciweavers

4536 search results - page 279 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
COMGEO
2010
ACM
15 years 6 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
ICDM
2006
IEEE
164views Data Mining» more  ICDM 2006»
16 years 22 days ago
Unsupervised Learning of Tree Alignment Models for Information Extraction
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
Philip Zigoris, Damian Eads, Yi Zhang
PRIB
2009
Springer
100views Bioinformatics» more  PRIB 2009»
16 years 1 months ago
Evidence-Based Clustering of Reads and Taxonomic Analysis of Metagenomic Data
Abstract. The rapidly emerging field of metagenomics seeks to examine the genomic content of communities of organisms to understand their roles and interactions in an ecosystem. I...
Gianluigi Folino, Fabio Gori, Mike S. M. Jetten, E...
MICCAI
2007
Springer
16 years 25 days ago
Robust Autonomous Model Learning from 2D and 3D Data Sets
In this paper we propose a weakly supervised learning algorithm for appearance models based on the minimum description length (MDL) principle. From a set of training images or volu...
Georg Langs, Rene Donner, Philipp Peloschek, Horst...
SSDBM
2005
IEEE
218views Database» more  SSDBM 2005»
16 years 8 days ago
The "Best K" for Entropy-based Categorical Data Clustering
With the growing demand on cluster analysis for categorical data, a handful of categorical clustering algorithms have been developed. Surprisingly, to our knowledge, none has sati...
Keke Chen, Ling Liu