Sciweavers

4007 search results - page 745 / 802
» Computation with imprecise probabilities
Sort
View
PODC
2009
ACM
14 years 9 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
FOCS
2007
IEEE
14 years 3 months ago
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
Subhash Khot, Assaf Naor
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 2 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler

Publication
233views
15 years 7 months ago
Error Characteristics of Fiber Distributed Data Interface (FDDI)
An analysis is made of the impact of various design decisions on the error detection capability of the fiber distributed data interface (FDDI), a 100-Mb/s fiber-optic LAN stardard ...
R. Jain
DAC
2009
ACM
14 years 9 months ago
Analysis and mitigation of process variation impacts on Power-Attack Tolerance
Embedded cryptosystems show increased vulnerabilities to implementation attacks such as power analysis. CMOS technology trends are causing increased process variations which impac...
Lang Lin, Wayne P. Burleson