Sciweavers

865 search results - page 47 / 173
» Random graph models for the web graph
Sort
View
WWW
2004
ACM
16 years 11 days ago
Graph-based text database for knowledge discovery
While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling...
Junji Tomita, Hidekazu Nakawatase, Megumi Ishii
FCT
2005
Springer
15 years 5 months ago
Reconstructing Many Partitions Using Spectral Techniques
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
Joachim Giesen, Dieter Mitsche
ACCV
2009
Springer
15 years 6 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
STOC
1990
ACM
108views Algorithms» more  STOC 1990»
15 years 3 months ago
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
Wayne Goddard, Valerie King, Leonard J. Schulman
CIKM
2010
Springer
14 years 10 months ago
Challenges in personalized authority flow based ranking of social media
As the social interaction of Internet users increases, so does the need to effectively rank social media. We study the challenges of personalized ranking of blog posts. Web search...
Hassan Sayyadi, John Edmonds, Vagelis Hristidis, L...