Sciweavers

4843 search results - page 490 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
ICPR
2008
IEEE
16 years 7 months ago
Tailoring text for automatic layouting of newspaper pages
We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...
Leonhard Hennig, Thomas Strecker
ICASSP
2009
IEEE
16 years 1 months ago
Transmit beamforming for wireless multicasting using channel orthogonalization and local refinement
The problem of transmit beamforming for single-group multicasting is considered, where the objective is to transmit common information to a (large) number of users. The transmitte...
Ahmed Abdelkader, Imran Wajid, Alex B. Gershman, N...
165
Voted
FAW
2009
Springer
177views Algorithms» more  FAW 2009»
16 years 27 days ago
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong ...
FSTTCS
2009
Springer
16 years 27 days ago
Algorithms for Message Ferrying on Mobile ad hoc Networks
ABSTRACT. Message Ferrying is a mobility assisted technique for working around the disconnectedness and sparsity of Mobile ad hoc networks. One of the important questions which ari...
Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das...
GECCO
2009
Springer
16 years 27 days ago
An evolutionary approach to planning IEEE 802.16 networks
Efficient and effective deployment of IEEE 802.16 networks to service an area of users with certain traffic demands is an important network planning problem. We resort to an evol...
Ting Hu, Yuanzhu Peter Chen, Wolfgang Banzhaf, Rob...