1298 search results - page 111 / 260 » The online set cover problem |
164
click to vote
ELPUB
1999
ACM
15 years 10 months ago
1999
ACM
Internet based services, particularly asynchronous communication services, offer an environment suited to the rise of knowledge communities. Knowledge communities, or invisible co...
167
click to vote
EDBT
2010
ACM
16 years 1 months ago
2010
ACM
This paper addresses a fundamental and challenging problem with broad applications: efficient processing of region-based promotion queries, i.e., to discover the top-k most inter...
146
click to vote
CONEXT
2008
ACM
15 years 8 months ago
2008
ACM
Increased AP density in enterprise WLANs leads to increasing RF interference and decreasing performance. An important step towards mitigating this problem is to construct precise ...
193
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
175
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
Keyword search has been recently extended to relational databases to retrieve information from text-rich attributes. However, all the existing methods focus on finding individual...