Sciweavers

3192 search results - page 348 / 639
» The minimum latency problem
Sort
View
MP
2006
88views more  MP 2006»
15 years 4 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...
TSP
2008
124views more  TSP 2008»
15 years 4 months ago
Robust Beamforming via Worst-Case SINR Maximization
Minimum variance beamforming, which uses a weight vector that maximizes the signal-to-interference-plus-noise ratio (SINR), is often sensitive to estimation error and uncertainty i...
Seung-Jean Kim, Alessandro Magnani, Almir Mutapcic...
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
15 years 4 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
ICIAR
2010
Springer
15 years 3 months ago
Face Recognition from Color Images Using Sparse Projection Analysis
The paper presents a novel feature extraction technique for face recognition which uses sparse projection axes to compute a lowdimensional representation of face images. The propos...
Vitomir Struc, Nikola Pavesic
NETWORKS
2010
15 years 2 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...