776 search results - page 36 / 156 » Distributed Information Regularization on Graphs |
83
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract—We introduce a new class of exact MinimumBandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process tha...
82
Voted
LAWEB
2003
IEEE
15 years 5 months ago
2003
IEEE
We perform a clustering of the Chilean Web Graph using a local fitness measure, optimized by simulated annealing, and compare the obtained cluster distribution to that of two mod...
111
Voted
PRL
2010
14 years 11 months ago
2010
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
CORR
2010
Springer
15 years 17 days ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
87
Voted
SIGMETRICS
2005
ACM
15 years 6 months ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...