Sciweavers

10670 search results - page 2042 / 2134
» Required Information Release
Sort
View
148
Voted
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 5 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
114
Voted
ISER
1995
Springer
100views Robotics» more  ISER 1995»
15 years 5 months ago
Distributed Robotic Manipulation: Experiments in Minimalism
Minimalism pursues the following agenda: For a given robotics task, nd the minimal con guration of resources required to solve the task. Thus, minimalism attempts to reduce the re...
Karl-Friedrich Böhringer, Russell Brown, Bruc...
SC
1995
ACM
15 years 5 months ago
Input/Output Characteristics of Scalable Parallel Applications
Rapid increases in computing and communication performance are exacerbating the long-standing problem of performance-limited input/output. Indeed, for many otherwise scalable para...
Phyllis Crandall, Ruth A. Aydt, Andrew A. Chien, D...
SP
1991
IEEE
121views Security Privacy» more  SP 1991»
15 years 5 months ago
The SRI IDES Statistical Anomaly Detector
SRI International’s real-time intrusion-detection expert system (IDES) system contains a statistical subsystem that observes behavior on a moniioreci cornpuier system and adapti...
H. S. Javitz, A. Valdes
121
Voted
COMPGEOM
1987
ACM
15 years 5 months ago
Polygon Properties Calculated from the Vertex Neighborhoods
Calculating properties of polyhedra given only the set of the locations and neighborhoods of the vertices is easy. Possible properties include volume, surface area, and point cont...
Wm. Randolph Franklin
« Prev « First page 2042 / 2134 Last » Next »