2031 search results - page 406 / 407 » On Tree-Constrained Matchings and Generalizations |
APPROX
2011
Springer
12 years 6 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
CIKM
2011
Springer
12 years 6 months ago
2011
Springer
A framework is presented for discovering partial duplicates in large collections of scanned books with optical character recognition (OCR) errors. Each book in the collection is r...
CIKM
2011
Springer
12 years 6 months ago
2011
Springer
This paper addresses the problem of mining named entity translations from comparable corpora, specifically, mining English and Chinese named entity translation. We first observe...
ICDE
2006
IEEE
14 years 2 days ago
2006
IEEE
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
STOC
2005
ACM
13 years 11 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...