Sciweavers

6740 search results - page 472 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ICPR
2010
IEEE
15 years 4 months ago
NAVIDOMASS: Structural-based Approaches Towards Handling Historical Documents
In the context of the NAVIDOMASS project, the problematic of this paper concerns the clustering of historical document images. We propose a structural-based framework to handle the...
Salim Jouili, Mickaël Coustaty, Salvatore Tab...
FOCS
2003
IEEE
16 years 4 days ago
Clustering with Qualitative Information
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
Moses Charikar, Venkatesan Guruswami, Anthony Wirt...
JAL
2006
114views more  JAL 2006»
15 years 6 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
PR
2010
145views more  PR 2010»
15 years 5 months ago
Graph-optimized locality preserving projections
Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recog...
Limei Zhang, Lishan Qiao, Songcan Chen
ICIP
2008
IEEE
16 years 8 months ago
Graph-based deinterlacing
This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fa...
Jérôme Roussel, Pascal Bertolino