Sciweavers

539 search results - page 23 / 108
» The N R One Time Password System
Sort
View
DSN
2007
IEEE
15 years 4 months ago
How to Choose a Timing Model?
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
FOCS
2008
IEEE
14 years 9 months ago
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
Nikhil R. Devanur, Ravi Kannan
VTC
2006
IEEE
141views Communications» more  VTC 2006»
15 years 3 months ago
Closed-Form BER Analysis for Antenna Selection Using Orthogonal Space-Time Block Codes
— Despite significant research efforts, closed-form bit error rate (BER) expressions for multiple-input multiple-output (MIMO) systems employing transmit antenna selection and o...
Saeed Kaviani, Chintha Tellambura
76
Voted
CCS
2010
ACM
14 years 9 months ago
DIFC programs by automatic instrumentation
Decentralized information flow control (DIFC) operating systems provide applications with mechanisms for enforcing information-flow policies for their data. However, significant o...
William R. Harris, Somesh Jha, Thomas W. Reps
SPIN
2010
Springer
14 years 8 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...