Sciweavers

1730 search results - page 304 / 346
» Open Archiving for Open Research
Sort
View
CHI
2002
ACM
15 years 10 months ago
Effects of four computer-mediated communications channels on trust development
When virtual teams need to establish trust at a distance, it is advantageous for them to use rich media to communicate. We studied the emergence of trust in a social dilemma game ...
Nathan Bos, Judith S. Olson, Darren Gergle, Gary M...
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
15 years 10 months ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
SIGMOD
2002
ACM
236views Database» more  SIGMOD 2002»
15 years 10 months ago
The Cougar Approach to In-Network Query Processing in Sensor Networks
The widespread distribution and availability of smallscale sensors, actuators, and embedded processors is transforming the physical world into a computing platform. One such examp...
Yong Yao, Johannes Gehrke
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
15 years 7 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang