Sciweavers

208 search results - page 21 / 42
» Improved upper bounds on the crossing number
Sort
View
JSAC
2007
180views more  JSAC 2007»
13 years 7 months ago
A Cross-Layer Approach for WLAN Voice Capacity Planning
— This paper presents an analytical approach to determining the maximum number of on/off voice flows that can be supported over a wireless local area network (WLAN), under a qua...
Yu Cheng, Xinhua Ling, Wei Song, Lin X. Cai, Weihu...
RTSS
2006
IEEE
14 years 1 months ago
Tightening the Bounds on Feasible Preemption Points
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...
Harini Ramaprasad, Frank Mueller
ORDER
2006
97views more  ORDER 2006»
13 years 7 months ago
Upward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
Vida Dujmovic, David R. Wood
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
14 years 27 days ago
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
Hao Yuan, Linji Yang, Erdong Chen
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
13 years 12 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....