Sciweavers

5055 search results - page 228 / 1011
» Relative Timing
Sort
View
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
16 years 6 months ago
Generating random regular graphs
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
Jeong Han Kim, Van H. Vu
ICMCS
2008
IEEE
129views Multimedia» more  ICMCS 2008»
16 years 29 days ago
Evaluation of segment-based proxy caching for video on demand
In this paper, we derive an analytical model for the evaluation of the performance of a Video on Demand (VoD) system. The model estimates the mean waiting time achievable by the P...
Muhammad Muhammad, Wei Tu, Eckehard G. Steinbach
EJASP
2010
114views more  EJASP 2010»
15 years 1 months ago
Packet Format Design and Decision Directed Tracking Methods for Filter Bank Multicarrier Systems
Packetized data transmission is commonly used in wireless communication systems. Each packet starts with a preamble which is used to synchronize the receiver with carrier frequenc...
Peiman Amini, Behrouz Farhang-Boroujeny
ARTDB
1997
Springer
269views Database» more  ARTDB 1997»
15 years 10 months ago
Parallel Event Detection in Active Database Systems: The Heart of the Matter
This paper proposes a strategy for parallel composite event detection in Active database systems (DBS). Up to now, the detection is sequential and totally synchronized, and thus p...
Ulrike Jaeger, Johann K. Obermaier
IJCAI
2003
15 years 8 months ago
Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
Daniel S. Bernstein, Lev Finkelstein, Shlomo Zilbe...