4009 search results - page 311 / 802 » Clustering on Complex Graphs |
387
click to vote
PAMI
2010
15 years 5 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
118
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
The k-anonymity model is a privacy-preserving approach that has been extensively studied for the past few years. To minimize the information loss due to anonymization, it is cruci...
169
click to vote
NCA
2005
IEEE
16 years 9 days ago
2005
IEEE
Datacenters are complex environments consisting of thousands of failure-prone commodity components connected by fast, high-capacity interconnects. The software running on such dat...
182
click to vote
EGPGV
2004
Springer
16 years 3 days ago
2004
Springer
Data coming from complex simulation models reach easily dimensions much greater than available computational resources. Visualization of such data still represents the most intuit...
168
click to vote
NPC
2004
Springer
16 years 2 days ago
2004
Springer
The complexity of services and applications provided by Web sites is ever increasing as integration of traditional Web publishing sites with new paradigms, i.e., e-commerce. Each d...