697 search results - page 17 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
MICAI
2007
Springer
14 years 1 months ago
2007
Springer
Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target docum...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
RSA
2010
13 years 6 months ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...