Sciweavers

840 search results - page 97 / 168
» Open multi-methods for c
Sort
View
SIAMDM
2008
139views more  SIAMDM 2008»
15 years 3 months ago
Approximate Integer Decompositions for Undirected Network Design Problems
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
Chandra Chekuri, F. Bruce Shepherd
135
Voted
TCC
2009
Springer
116views Cryptology» more  TCC 2009»
16 years 3 months ago
Simulation-Based Concurrent Non-malleable Commitments and Decommitments
Abstract. In this paper we consider commitment schemes that are secure against concurrent man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions of security for...
Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti
RTSS
2006
IEEE
15 years 9 months ago
MCGREP - A Predictable Architecture for Embedded Real-Time Systems
Real-time systems design involves many important choices, including that of the processor. The fastest processors achieve performance by utilizing architectural features that make...
Jack Whitham, Neil C. Audsley
PEWASUN
2004
ACM
15 years 8 months ago
A novel solution for achieving anonymity in wireless ad hoc networks
A mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of ...
Azzedine Boukerche, Khalil El-Khatib, Li Xu, Larry...
COLT
2004
Springer
15 years 8 months ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum