1298 search results - page 126 / 260 » The online set cover problem |
148
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
We show the underpinnings of a method for summarizing documents: it ingests a document and automatically highlights a small set of sentences that are expected to cover the differ...
181
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
174
click to vote
OTM
2009
Springer
16 years 1 months ago
2009
Springer
Collusion attacks remain a major problem of reputation and trust models, in mobile ad hoc networks. By covering up malicious behaviour of one another from the remaining part of the...
179
click to vote
DOLAP
2004
ACM
15 years 12 months ago
2004
ACM
We address the inference control problem in data cubes with some data known to users through external knowledge. The goal of inference controls is to prevent exact values of sensi...
171
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Query-based web search is an integral part of many people’s daily activities. Most do not realize that their search history can be used to identify them (and their interests). I...