Sciweavers

274 search results - page 51 / 55
» Identifying sets of key players in a social network
Sort
View
WWW
2011
ACM
13 years 2 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
JUCS
2010
147views more  JUCS 2010»
13 years 5 months ago
Ambient Intelligence: Beyond the Inspiring Vision
Abstract: Ambient Intelligence (AmI) has emerged in the past 10 years as a multidisciplinary field within ubiquitous computing, attracting considerable research, funding and publi...
Rui José, Helena Rodrigues, Nuno Otero
BMCBI
2010
183views more  BMCBI 2010»
13 years 7 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
SDM
2007
SIAM
177views Data Mining» more  SDM 2007»
13 years 8 months ago
Multi-way Clustering on Relation Graphs
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
Arindam Banerjee, Sugato Basu, Srujana Merugu
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
13 years 8 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh