1298 search results - page 89 / 260 » The online set cover problem |
149
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
142
click to vote
ECML
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider the problem of learning a mapping from question to answer messages. The training data for this problem consist of pairs of messages that have been received an...
190
click to vote
FOCS
2008
IEEE
16 years 26 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
177
click to vote
IJWIN
2006
15 years 6 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
298
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
While social interactions are critical to understanding consumer behavior, the relationship between social and commerce networks has not been explored on a large scale. We analyze...