Sciweavers

47 search results - page 8 / 10
» Measuring the mixing time of social graphs
Sort
View
WWW
2009
ACM
14 years 8 months ago
Behavioral profiles for advanced email features
We examine the behavioral patterns of email usage in a large-scale enterprise over a three-month period. In particular, we focus on two main questions: (Q1) what do replies depend...
Thomas Karagiannis, Milan Vojnovic
IPPS
2008
IEEE
14 years 2 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
ECIR
2011
Springer
12 years 11 months ago
A User-Oriented Model for Expert Finding
Expert finding addresses the problem of retrieving a ranked list of people who are knowledgeable on a given topic. Several models have been proposed to solve this task, but so far...
Elena Smirnova, Krisztian Balog
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
14 years 2 months ago
Dogged Learning for Robots
— Ubiquitous robots need the ability to adapt their behaviour to the changing situations and demands they will encounter during their lifetimes. In particular, non-technical user...
Daniel H. Grollman, Odest Chadwicke Jenkins