Sciweavers

1261 search results - page 81 / 253
» Approximation algorithms for aligning points
Sort
View
133
Voted
COMPGEOM
2005
ACM
15 years 4 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
ICML
2006
IEEE
16 years 3 months ago
Clustering documents with an exponential-family approximation of the Dirichlet compound multinomial distribution
The Dirichlet compound multinomial (DCM) distribution, also called the multivariate Polya distribution, is a model for text documents that takes into account burstiness: the fact ...
Charles Elkan
146
Voted
ICDAR
2011
IEEE
14 years 2 months ago
OCR-Driven Writer Identification and Adaptation in an HMM Handwriting Recognition System
—We present an OCR-driven writer identification algorithm in this paper. Our algorithm learns writer-specific characteristics more precisely from explicit character alignment usi...
Huaigu Cao, Rohit Prasad, Prem Natarajan
131
Voted
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
15 years 2 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
110
Voted
IJIT
2004
15 years 4 months ago
A Fuzzy Classifier with Evolutionary Design of Ellipsoidal Decision Regions
A fuzzy classifier using multiple ellipsoids approximating decision regions for classification is to be designed in this paper. An algorithm called Gustafson-Kessel algorithm (GKA)...
Leehter Yao, Kuei-Song Weng, Cherng-Dir Huang