2270 search results - page 97 / 454 » On the distribution of eigenvalues of graphs |
179
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
272
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
200
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
Integrated access to multiple distributed and autonomous RDF data sources is a key challenge for many semantic web applications. As a reaction to this challenge, SPARQL, the W3C Re...
182
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
147
click to vote
EUROPAR
2009
Springer
15 years 11 months ago
2009
Springer
A high-level understanding of how an application executes and which performance characteristics it exhibits is essential in many areas of high performance computing, such as applic...