1933 search results - page 31 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
136
click to vote
SIGIR
2004
ACM
15 years 8 months ago
2004
ACM
Pseudo feedback is a commonly used technique to improve information retrieval performance. It assumes a few top-ranked documents to be relevant, and learns from them to improve th...
140
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
140
click to vote
SODA
2003
ACM
15 years 4 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
125
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
118
Voted
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...