Sciweavers

2899 search results - page 295 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
15 years 6 months ago
Computing the Greedy Spanner in Near-Quadratic Time
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil M...
DC
2006
15 years 6 months ago
Performing work in broadcast networks
We consider the problem of how to schedule t similar and independent tasks to be performed in a synchronous distributed system of p stations communicating via multiple-access chan...
Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Li...
GLOBECOM
2010
IEEE
15 years 4 months ago
Dynamic Channel Selection in Cognitive Radio Network with Channel Heterogeneity
We consider the channel selection problem in a cognitive radio network with heterogenous channel availabilities at different nodes. We formulate the maximum channel selection (MCS)...
Fen Hou, Jianwei Huang
ICIP
2003
IEEE
16 years 8 months ago
Near-optimal multipath streaming of H.264 using reference frame selection
New video codink standards such as H.264 offer the flexibility to select from a number of reference frames for motion-estimation for a given predicted frame. In this paper, we pro...
Gene Cheung
GLOBECOM
2009
IEEE
16 years 1 months ago
Downlink Mobile OFDMA Resource Allocation with Minimum User Rate Requests
— The problem of resource allocation (RA) in a downlink OFDMA system with minimum user rate requests is examined under the realistic scenario of partial (imperfect) channel state...
Stelios Stefanatos, Christos Papathanasiou, Nikos ...