776 search results - page 58 / 156 » Distributed Information Regularization on Graphs |
101
Voted
EMNLP
2007
15 years 2 months ago
2007
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...
NETWORKING
2008
15 years 2 months ago
2008
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
132
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
AIRS
2006
Springer
15 years 4 months ago
2006
Springer
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
116
Voted
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...