646 search results - page 72 / 130 » Generalized connected domination in graphs |
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
SIGIR
2009
ACM
14 years 3 months ago
2009
ACM
Link analysis methods have been used successfully for knowledge discovery from the link structure of mutually linking entities. Existing link analysis methods have been inherently...
SIGIR
2010
ACM
14 years 19 days ago
2010
ACM
Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as que...
CHI
2009
ACM
14 years 9 months ago
2009
ACM
Graphs are often visualized using node-link representations: vertices are depicted as dots, edges are depicted as (poly)lines connecting two vertices. A directed edge running from...