Sciweavers

2079 search results - page 6 / 416
» Universality of random graphs
Sort
View
ACL
2006
15 years 1 months ago
LexNet: A Graphical Environment for Graph-Based NLP
This interactive presentation describes LexNet, a graphical environment for graph-based NLP developed at the University of Michigan. LexNet includes LexRank (for text summarizatio...
Dragomir R. Radev, Günes Erkan, Anthony Fader...
COMPGEOM
2010
ACM
15 years 4 months ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
15 years 1 months ago
On properties of random dissections and triangulations
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
TKDE
2012
198views Formal Methods» more  TKDE 2012»
13 years 2 months ago
Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs
— Most proposed DHTs engage certain topology maintenance mechanisms specific to the static graphs on which they are based. The designs of these mechanisms are complicated and rep...
Yiming Zhang, Ling Liu
81
Voted
ICPR
2002
IEEE
16 years 25 days ago
GraphGrep: A Fast and Universal Method for Querying Graphs
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...
Rosalba Giugno, Dennis Shasha