1298 search results - page 78 / 260 » The online set cover problem |
161
click to vote
IJCAI
2007
15 years 7 months ago
2007
In recent years, there has been a growing interest in using rich representations such as relational languages for reinforcement learning. However, while expressive languages have ...
182
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper considers using online binary classification for target detection where the goal is to identify signals of interest within a sequence of received signals generated by ...
165
click to vote
PAKDD
2005
ACM
15 years 12 months ago
2005
ACM
We study the problem of mining frequent value sets from a large sensor network. We discuss how sensor stream data could be represented that facilitates efficient online mining and ...
177
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
246
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
When integrating data from multiple sources, a key task that online communities often face is to match the schemas of the data sources. Today, such matching often incurs a huge wor...