Sciweavers

4112 search results - page 230 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
TSP
2010
15 years 1 months ago
A dual perspective on separable semidefinite programming with applications to optimal downlink beamforming
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
Yongwei Huang, Daniel Pérez Palomar
JISE
2008
127views more  JISE 2008»
15 years 6 months ago
Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network
We propose in this paper a two-phase algorithm, named algorithm Layered-Cutting, to address the problem of broadcast program generation in a multi-system heterogeneous overlayed w...
Jiun-Long Huang, Jui-Nan Lin
CPM
2009
Springer
183views Combinatorics» more  CPM 2009»
15 years 4 months ago
Permuted Longest-Common-Prefix Array
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
Juha Kärkkäinen, Giovanni Manzini, Simon...
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
16 years 4 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
IFIP
1994
Springer
15 years 10 months ago
Program Speedups in Theory and Practice
The aim of this discussion paper is to stimulate (or perhaps to provoke) stronger interactions among theoreticians and practitioners interested in efficient problem solutions. We ...
Neil D. Jones