Sciweavers

255 search results - page 29 / 51
» A new upper bound for the bipartite Ramsey problem
Sort
View
MMS
1998
15 years 5 months ago
Packet Audio Playout Delay Adjustment: Performance Bounds and Algorithms
In packet audio applications, packets are buffered at a receiving site and their playout delayed in order to compensate for variable network delays. In this paper, we consider the ...
Sue B. Moon, James F. Kurose, Donald F. Towsley
ORDER
2007
89views more  ORDER 2007»
15 years 5 months ago
On-line Chain Partitioning of Up-growing Interval Orders
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
Patrick Baier, Bartlomiej Bosek, Piotr Micek
CORR
2009
Springer
99views Education» more  CORR 2009»
15 years 3 months ago
Quotient Complexity of Regular Languages
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
Janusz A. Brzozowski
MOBIHOC
2007
ACM
16 years 5 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
TOCL
2008
102views more  TOCL 2008»
15 years 6 months ago
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
Helmut Seidl, Kumar Neeraj Verma