Sciweavers

4242 search results - page 587 / 849
» For a science of group interaction
Sort
View
ICML
2003
IEEE
16 years 7 months ago
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
Jeremy Kubica, Andrew W. Moore, David Cohn, Jeff G...
SIGCSE
2009
ACM
119views Education» more  SIGCSE 2009»
16 years 7 months ago
The summer academy for advancing deaf and hard of hearing in computing
Deaf and hard of hearing students are an underrepresented group in computing and face extra challenges in university-level computing courses. This paper describes a 9-week Summer ...
Anna Cavender, Richard E. Ladner, Robert I. Roth
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
16 years 7 months ago
Finding tribes: identifying close-knit individuals from employment patterns
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
Lisa Friedland, David Jensen
RECOMB
2008
Springer
16 years 6 months ago
Perfect DCJ Rearrangement
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...
Sèverine Bérard, Annie Chateau, Cedr...
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
16 years 6 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...