Sciweavers

627 search results - page 99 / 126
» Efficient On-the-Fly Algorithms for the Analysis of Timed Ga...
Sort
View
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 8 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
ICDAR
1999
IEEE
13 years 11 months ago
A Two-state Markov Chain Model of Degraded Document Images
We propose a two-state Markov chain model of degraded document images. The model generates random and burst noise to simulate isolated pixel reversal as well as blurring of a larg...
Shamik Sural, P. K. Das
ICIP
2010
IEEE
13 years 5 months ago
MVMP: Multi-view Matching Pursuit with geometry constraints
Sets of multi-view images that capture plenoptic information from different viewpoints are typically related by geometric constraints. The proper analysis of these constraints is ...
Ivana Tosic, Antonio Ortega, Pascal Frossard
RECOMB
2005
Springer
14 years 7 months ago
Information Theoretic Approaches to Whole Genome Phylogenies
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
David Burstein, Igor Ulitsky, Tamir Tuller, Benny ...
JCB
2006
124views more  JCB 2006»
13 years 7 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...