Sciweavers

2463 search results - page 275 / 493
» Rankings of Directed Graphs
Sort
View
164
Voted
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
13 years 11 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...
114
Voted
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 2 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...
224
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
A distributed and privacy preserving algorithm for identifying information hubs in social networks
—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...
Muhammad Usman Ilyas, Muhammad Zubair Shafiq, Alex...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 4 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
139
Voted
ICSE
2008
IEEE-ACM
16 years 3 months ago
CCVisu: automatic visual software decomposition
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
Dirk Beyer