Sciweavers

3708 search results - page 565 / 742
» Approximating Betweenness Centrality
Sort
View
CHI
2005
ACM
16 years 6 months ago
Assessing differential usage of usenet social accounting meta-data
We describe a usage study of Netscan\Tech, a system that generates and publishes daily a range of social metrics across three dimensions: newsgroup, author, and thread, for a set ...
A. J. Bernheim Brush, Xiaoqing Wang, Tammara Combs...
CHI
2005
ACM
16 years 6 months ago
Homophily in online dating: when do you like someone like yourself?
Psychologists have found that actual and perceived similarity between potential romantic partners in demographics, attitudes, values, and attractiveness correlate positively with ...
Andrew T. Fiore, Judith S. Donath
POPL
2007
ACM
16 years 6 months ago
Scrap your boilerplate with XPath-like combinators
XML programming involves idioms for expressing `structure shyness' such as the descendant axis of XPath or the default templates of XSLT. We initiate a discussion of the rela...
Ralf Lämmel
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
16 years 6 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 6 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan