Sciweavers

9832 search results - page 1659 / 1967
» An Object Model for Multiprogramming
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
16 years 1 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
FOCS
2008
IEEE
16 years 1 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty
ICC
2008
IEEE
139views Communications» more  ICC 2008»
16 years 1 months ago
Practical Routing and Channel Assignment Scheme for Mesh Networks with Directional Antennas
Abstract— Wireless Mesh Network (WMN) has been recognized as one of the promising technologies to provide wireless broadband access. In addition to the multi-radio multi-channel ...
Wei Zhou, Xi Chen, Daji Qiao
CVPR
2007
IEEE
16 years 1 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
« Prev « First page 1659 / 1967 Last » Next »