Sciweavers

2095 search results - page 236 / 419
» Improved pebbling bounds
Sort
View
GLOBECOM
2009
IEEE
16 years 1 months ago
On Downlink Network MIMO under a Constrained Backhaul and Imperfect Channel Knowledge
— Next generation mobile communications systems will most likely employ network MIMO in order to mitigate inter-cell interference and improve system fairness and spectral effici...
Patrick Marsch, Gerhard Fettweis
IV
2009
IEEE
124views Visualization» more  IV 2009»
16 years 1 months ago
An Occlusion-Reduced 3D Hierarchical Data Visualization Technique
Occlusion is an important problem to be solved for readability improvement of 3D visualization techniques. This paper presents an occlusion reduction technique for cityscape-style...
Reiko Miyazaki, Takayuki Itoh
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
16 years 1 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
16 years 1 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
WASA
2009
Springer
80views Algorithms» more  WASA 2009»
16 years 1 months ago
Dynamic Scheduling of Pigeons for Delay Constrained Applications
Information collection in the disaster area is an important application of pigeon networks - a special type of delay tolerant networks (DTN). The aim of this paper is to explore hi...
Jiazhen Zhou, Jiang Li, Legand L. Burge III