Sciweavers

4114 search results - page 241 / 823
» Efficient Algorithms for the 2-Center Problems
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
EMNLP
2010
15 years 4 months ago
Dual Decomposition for Parsing with Non-Projective Head Automata
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
Terry Koo, Alexander M. Rush, Michael Collins, Tom...
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...
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