Sciweavers

29046 search results - page 5689 / 5810
» Computable Models
Sort
View
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 11 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
CPAIOR
2009
Springer
15 years 11 months ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
CRYPTO
2009
Springer
122views Cryptology» more  CRYPTO 2009»
15 years 11 months ago
Utility Dependence in Correct and Fair Rational Secret Sharing
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
Gilad Asharov, Yehuda Lindell
159
Voted
ERSHOV
2009
Springer
15 years 11 months ago
Multi-level Virtual Machine Debugging Using the Java Platform Debugger Architecture
Abstract. Debugging virtual machines (VMs) presents unique challenges, especially meta-circular VMs, which are written in the same language they implement. Making sense of runtime ...
Thomas Würthinger, Michael L. Van De Vanter, ...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 11 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
« Prev « First page 5689 / 5810 Last » Next »