Sciweavers

2612 search results - page 442 / 523
» Switching Graphs and Their Complexity
Sort
View
WWW
2008
ACM
14 years 10 months ago
Personalized view-based search and visualization as a means for deep/semantic web data access
Effective access to and navigation in information stored in deep Web ontological repositories or relational databases has yet to be realized due to issues with usability of user i...
Mária Bieliková, Michal Tvarozek
WWW
2004
ACM
14 years 10 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
14 years 10 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 10 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 10 months ago
Co-evolution of social and affiliation networks
In our work, we address the problem of modeling social network generation which explains both link and group formation. Recent studies on social network evolution propose generati...
Elena Zheleva, Hossam Sharara, Lise Getoor