1986 search results - page 218 / 398 » Path Separability of Graphs |
111
Voted
WSC
2004
15 years 3 months ago
2004
Stream Option Manager (SOM) is a set of mathematical tools developed at The MITRE Corporation's Center for Advanced Aviation System Development (CAASD). While still under dev...
130
click to vote
TIT
2008
15 years 2 months ago
2008
We are interested in the connection-level stability of a network employing congestion control. In particular, we study how the stability region of the network (i.e., the set of off...
131
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
119
click to vote
WG
1998
Springer
15 years 6 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
122
click to vote
CICLING
2010
Springer
15 years 9 months ago
2010
Springer
Recent research works on unsupervised word sense disambiguation report an increase in performance, which reduces their handicap from the respective supervised approaches for the sa...