Sciweavers

2463 search results - page 83 / 493
» Rankings of Directed Graphs
Sort
View
PAMI
2012
11 years 11 months ago
Angular Embedding: A Robust Quadratic Criterion
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
Stella Yu
DM
2006
78views more  DM 2006»
13 years 9 months ago
On polynomial digraphs
Let (x, y) be a bivariate polynomial with complex coefficients. The zeroes of (x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(). This p...
Josep M. Brunat, Antonio Montes
WWW
2007
ACM
14 years 9 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
ICCD
2004
IEEE
115views Hardware» more  ICCD 2004»
14 years 6 months ago
ACG-Adjacent Constraint Graph for General Floorplans
ACG (Adjacent Constraint Graph) is invented as a general floorplan representation. It has advantages of both adjacency graph and constraint graph of a floorplan: edges in an ACG...
Hai Zhou, Jia Wang
DM
2006
135views more  DM 2006»
13 years 9 months ago
Berge's conjecture on directed path partitions - a survey
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
Irith Ben-Arroyo Hartman