Sciweavers

881 search results - page 119 / 177
» connection 2004
Sort
View
ESA
2004
Springer
91views Algorithms» more  ESA 2004»
15 years 3 months ago
Maximizing Throughput in Multi-queue Switches
We study a basic problem in Multi-Queue switches. A switch connects m input ports to a single output port. Each input port is equipped with an incoming FIFO queue with bounded cap...
Yossi Azar, Arik Litichevskey
ESA
2004
Springer
125views Algorithms» more  ESA 2004»
15 years 3 months ago
Approximation Algorithms for Quickest Spanning Tree Problems
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...
Refael Hassin, Asaf Levin
EUROCRYPT
2004
Springer
15 years 3 months ago
Multi-party Computation with Hybrid Security
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
Matthias Fitzi, Thomas Holenstein, Jürg Wulls...
EUSAI
2004
Springer
15 years 3 months ago
Towards a Playful User Interface for Home Entertainment Systems
Abstract. In this paper we propose a tangible cube as an input device for playfully changing between different TV-channels. First we consider several design approaches and compare ...
Florian Block, Albrecht Schmidt, Nicolas Villar, H...
FC
2004
Springer
94views Cryptology» more  FC 2004»
15 years 3 months ago
The Ephemeral Pairing Problem
Abstract In wireless ad-hoc broadcast networks the pairing problem consists of establishing a (long-term) connection between two specific physical nodes in the network that do not...
Jaap-Henk Hoepman