Sciweavers

712 search results - page 57 / 143
» On Spectral Graph Drawing
Sort
View
GD
2006
Springer
14 years 14 days ago
Parameterized st -Orientations of Graphs: Algorithms and Experiments
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
Charalampos Papamanthou, Ioannis G. Tollis
WCC
2005
Springer
156views Cryptology» more  WCC 2005»
14 years 2 months ago
One and Two-Variable Interlace Polynomials: A Spectral Interpretation
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
Constanza Riera, Matthew G. Parker
ACL
2006
13 years 10 months ago
Unsupervised Relation Disambiguation Using Spectral Clustering
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. I...
Jinxiu Chen, Dong-Hong Ji, Chew Lim Tan, Zheng-Yu ...
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 9 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
AUIC
2006
IEEE
14 years 2 months ago
Fluid sketching of directed graphs
We describe a prototype sketch-based system that allows users to draw and manipulate directed graphs using gestural input exclusively. The system incorporates the notion of fluid...
James Arvo, Kevin Novins