1933 search results - page 68 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
132
Voted
KDD
2006
ACM
16 years 3 months ago
2006
ACM
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
105
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
168
click to vote
WWW
2008
ACM
16 years 4 months ago
2008
ACM
Contextual advertising supports much of the Web's ecosystem today. User experience and revenue (shared by the site publisher ad the ad network) depend on the relevance of the...
163
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
121
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...