2485 search results - page 416 / 497 » Time Bounded Frequency Computations |
JMMA
2002
13 years 7 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
QUESTA
2010
13 years 6 months ago
2010
This paper investigates a queueing system in which the controller can perform admission and service rate control. In particular, we examine a single server queueing system with Po...
WG
2010
Springer
13 years 6 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
LCN
2008
IEEE
14 years 2 months ago
2008
IEEE
—End to end available bandwidth is often constrained by IEEE 802.11 hops in the access network. Available bandwidth measurement is particularly challenging in the wireless enviro...