1933 search results - page 34 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
SIGIR
2006
ACM
14 years 2 months ago
2006
ACM
Pseudo-relevance feedback has proven to be an effective strategy for improving retrieval accuracy in all retrieval models. However the performance of existing pseudo feedback meth...
MMDB
2003
ACM
14 years 1 months ago
2003
ACM
Conventional approaches to image retrieval are based on the assumption that relevant images are physically near the query image in some feature space. This is the basis of the clu...
ICANN
2007
Springer
14 years 2 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
ICALP
2011
Springer
13 years 5 days ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
FSTTCS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...