Sciweavers

1058 search results - page 184 / 212
» It's Doomed; We Can Prove It
Sort
View
GLOBECOM
2008
IEEE
14 years 4 months ago
Asymptotic Throughput in Wireless Multicast OFDM Systems
Abstract—With the proliferation of wireless multimedia applications, multicast/broadcast has been recognized as an efficient technique to transmit a large volume of data to mult...
Juan Liu, Wei Chen, Zhigang Cao, Ying Jun Zhang, S...
COMPGEOM
1992
ACM
14 years 1 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar
RTSS
1998
IEEE
14 years 2 months ago
Improved Response-Time Analysis Calculations
Schedulability analysis of fixed priority preemptive scheduled systems can be performed by calculating the worst-case response-time of the involved processes. The system is deemed...
Mikael Sjödin, Hans Hansson
TCC
2009
Springer
132views Cryptology» more  TCC 2009»
14 years 10 months ago
Authenticated Adversarial Routing
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
Yair Amir, Paul Bunn, Rafail Ostrovsky
SIGECOM
2005
ACM
117views ECommerce» more  SIGECOM 2005»
14 years 3 months ago
First-price path auctions
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
Nicole Immorlica, David R. Karger, Evdokia Nikolov...