2168 search results - page 13 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
We investigate the optimal selection of minimum contention window values to achieve proportional fairness in a multirate IEEE 802.11e test-bed. Unlike other approaches, the propos...
PODS
2012
ACM
11 years 10 months ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...