Sciweavers

910 search results - page 26 / 182
» Counting People in Groups
Sort
View
TON
1998
92views more  TON 1998»
13 years 9 months ago
Local error recovery in SRM: comparison of two approaches
—Scalable reliable multicast (SRM) is a framework for reliable multicast delivery. In order to maximize the collaboration among the group members in error recovery, both retransm...
Ching-Gung Liu, Deborah Estrin, Scott Shenker, Lix...
ANTS
2008
Springer
111views Algorithms» more  ANTS 2008»
13 years 12 months ago
Computing L-Series of Hyperelliptic Curves
We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic...
Kiran S. Kedlaya, Andrew V. Sutherland
DM
2008
112views more  DM 2008»
13 years 10 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
SAC
2009
ACM
14 years 4 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
GROUP
2007
ACM
14 years 1 months ago
That's what friends are for: facilitating 'who knows what' across group boundaries
We describe the design and evaluation of K-net, a social matching system to help people learn 'who knows what' in an organization by matching people with skills with tho...
N. Sadat Shami, Y. Connie Yuan, Dan Cosley, Ling X...