Sciweavers

1419 search results - page 51 / 284
» group 2010
Sort
View
SOCIALCOM
2010
14 years 9 months ago
Measuring Similarity between Sets of Overlapping Clusters
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon...
SCN
2010
Springer
176views Communications» more  SCN 2010»
14 years 10 months ago
The Fiat-Shamir Transform for Group and Ring Signature Schemes
The Fiat-Shamir (FS) transform is a popular tool to produce particularly efficient digital signature schemes out of identification protocols. It is known that the resulting signat...
Ming-Feng Lee, Nigel P. Smart, Bogdan Warinschi
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
15 years 9 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
CHI
2010
ACM
15 years 5 months ago
The NICE discussion room: integrating paper and digital media to support co-located group meetings
Current technological solutions that enable content creation and sharing during group discussion meetings are often cumbersome to use, and are commonly abandoned for traditional p...
Michael Haller, Jakob Leitner, Thomas Seifried, Ja...
GECCO
2010
Springer
159views Optimization» more  GECCO 2010»
15 years 4 months ago
Evolution of division of labor in genetically homogenous groups
Within nature, the success of many organisms, including certain species of insects, mammals, slime molds, and bacteria, is attributed to their performance of division of labor, wh...
Heather Goldsby, David B. Knoester, Charles Ofria