Sciweavers

2137 search results - page 216 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
162
Voted
ICALP
2005
Springer
15 years 12 months ago
The Generalized Deadlock Resolution Problem
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwa...
PVLDB
2010
152views more  PVLDB 2010»
15 years 4 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
ICPR
2006
IEEE
16 years 14 days ago
Regularized Locality Preserving Learning of Pre-Image Problem in Kernel Principal Component Analysis
In this paper, we address the pre-image problem in kernel principal component analysis (KPCA). The preimage problem finds a pattern as the pre-image of a feature vector defined in...
Weishi Zheng, Jian-Huang Lai
EMO
2003
Springer
137views Optimization» more  EMO 2003»
15 years 11 months ago
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
Luis Paquete, Thomas Stützle
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
15 years 1 months ago
On the optimal solutions of the infinite-horizon linear sensor scheduling problem
This paper studies the infinite-horizon sensor scheduling problem for linear Gaussian processes with linear measurement functions. Several important properties of the optimal infin...
Wei Zhang, Michael P. Vitus, Jianghai Hu, Alessand...