Sciweavers

4242 search results - page 651 / 849
» For a science of group interaction
Sort
View
SIGSOFT
2007
ACM
16 years 7 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 7 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
SIGMOD
2004
ACM
209views Database» more  SIGMOD 2004»
16 years 6 months ago
MAIDS: Mining Alarming Incidents from Data Streams
Real-time surveillance systems, network and telecommunication systems, and other dynamic processes often generate tremendous (potentially infinite) volume of stream data. Effectiv...
Y. Dora Cai, David Clutter, Greg Pape, Jiawei Han,...
CSCW
2010
ACM
16 years 3 months ago
Pitfalls of information access with visualizations in remote collaborative analysis
In a world of widespread information access, information can overwhelm collaborators, even with visualizations to help. We extend prior work to study the effect of shared informat...
Aruna D. Balakrishnan, Susan R. Fussell, Sara B. K...
CSCW
2010
ACM
16 years 3 months ago
Communication, collaboration, and bugs: the social nature of issue tracking in small, collocated teams
Issue tracking systems help organizations manage issue reporting, assignment, tracking, resolution, and archiving. Traditionally, it is the Software Engineering community that res...
Dane Bertram, Amy Voida, Saul Greenberg, Robert Wa...