1760 search results - page 327 / 352 » Connected Set Cover Problem and Its Applications |
EDBT
2010
ACM
14 years 2 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...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
SIGMOD
2010
ACM
14 years 15 days ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...