Sciweavers

5889 search results - page 420 / 1178
» Graph Layout Problems
Sort
View
FOCS
2003
IEEE
16 years 5 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
ICPR
2002
IEEE
16 years 8 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...
ICCD
2006
IEEE
137views Hardware» more  ICCD 2006»
16 years 3 months ago
Reduction of Crosstalk Pessimism using Tendency Graph Approach
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...
Murthy Palla, Klaus Koch, Jens Bargfrede, Manfred ...