4009 search results - page 70 / 802 » Clustering on Complex Graphs |
ESA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
125
click to vote
EMNLP
2006
15 years 1 months ago
2006
Word clustering is important for automatic thesaurus construction, text classification, and word sense disambiguation. Recently, several studies have reported using the web as a c...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
111
click to vote
SEKE
2001
Springer
15 years 4 months ago
2001
Springer
Source code analysis and inspection does not provide enough information to describe the structure of an objectoriented program completely because there are components and relation...