554 search results - page 42 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
ESA
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
We present a study of the web based user navigation patterns mining and propose a novel approach for clustering of user navigation patterns. The approach is based on the graph par...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
SOFSEM
2005
Springer
14 years 2 months ago
2005
Springer
d Abstract) Lubomir Torok Institute of Mathematics and Computer Science Slovak Academy of Sciences Severna 5, 974 01 Banska Bystrica, Slovak Republic 3-dimensional layout of graph...