2496 search results - page 90 / 500 » On covering by translates of a set |
108
click to vote
CORR
2008
Springer
15 years 2 hour ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
130
click to vote
CVPR
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we address the problem of classifying image sets, each of which contains images belonging to the same class but covering large variations in, for instance, viewpoin...
105
click to vote
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
AAAI
2008
15 years 2 months ago
2008
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...