Sciweavers

13987 search results - page 550 / 2798
» The Two Guards Problem
Sort
View
TVCG
2011
120views more  TVCG 2011»
15 years 2 months ago
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
Martin Nöllenburg, Alexander Wolff
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
TWC
2010
15 years 1 months ago
Optimal multi-channel cooperative sensing in cognitive radio networks
In this paper, optimal multi-channel cooperative sensing strategies in cognitive radio networks are investigated. A cognitive radio network with multiple potential channels is cons...
Rongfei Fan, Hai Jiang
ICASSP
2011
IEEE
14 years 11 months ago
Filter design with secrecy constraints: The multiple-input multiple-output Gaussian wiretap channel with zero forcing receive fi
This paper considers the problem of lter design with secrecy constraints, where two legitimate parties (Alice and Bob) communicate in the presence of an eavesdropper (Eve), over a...
Hugo Reboredo, Vinay Uday Prabhu, Miguel R. D. Rod...
LATIN
2010
Springer
16 years 2 months ago
Sharp Separation and Applications to Exact and Parameterized Algorithms
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grando...