1298 search results - page 102 / 260 » The online set cover problem |
135
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
We address the problem of identifying the domain of online databases. More precisely, given a set F of Web forms automatically gathered by a focused crawler and an online database...
184
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
176
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
178
click to vote
CRV
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
154
click to vote
DEBU
2010
15 years 6 months ago
2010
Much research has been conducted on the management of outdoor moving objects. In contrast, relatively little research has been conducted on indoor moving objects. The indoor setti...