Sciweavers

5909 search results - page 929 / 1182
» Information Sharing Communities
Sort
View
SENSYS
2003
ACM
15 years 12 months ago
On the scaling laws of dense wireless sensor networks
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
Praveen Kumar Gopala, Hesham El Gamal
CHI
2010
ACM
15 years 12 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...
ICNP
2002
IEEE
15 years 11 months ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...
SC
2009
ACM
15 years 11 months ago
Web 2.0-based social informatics data grid
The Social Informatics Data Grid (SIDGrid) is a new cyberinfrastructure designed to transform how social and behavioral scientists collect and annotate data, collaborate and share...
Wenjun Wu, Thomas D. Uram, Michael E. Papka
204
Voted
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr