Sciweavers

127 search results - page 19 / 26
» Linear sets in finite projective spaces
Sort
View
ICPR
2002
IEEE
14 years 10 months ago
Prototype Selection for Finding Efficient Representations of Dissimilarity Data
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
Elzbieta Pekalska, Robert P. W. Duin
ICDAR
2009
IEEE
13 years 6 months ago
Document Content Extraction Using Automatically Discovered Features
We report an automatic feature discovery method that achieves results comparable to a manually chosen, larger feature set on a document image content extraction problem: the locat...
Sui-Yu Wang, Henry S. Baird, Chang An
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
13 years 10 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
DCG
2010
171views more  DCG 2010»
13 years 9 months ago
Bregman Voronoi Diagrams
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
Jean-Daniel Boissonnat, Frank Nielsen, Richard Noc...
PAMI
2008
221views more  PAMI 2008»
13 years 9 months ago
Plane-Based Optimization for 3D Object Reconstruction from Single Line Drawings
In previous optimization-based methods of 3D planar-faced object reconstruction from single 2D line drawings, the missing depths of the vertices of a line drawing (and other parame...
Jianzhuang Liu, Liangliang Cao, Zhenguo Li, Xiaoou...