3898 search results - page 45 / 780 » On the Bit Extraction Problem |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
111
click to vote
SIAMCOMP
2011
14 years 4 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
TKDE
2010
14 years 8 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
SIGIR
2009
ACM
15 years 4 months ago
2009
ACM
This paper addresses the issue of automatically extracting keyphrases from document. Previously, this problem was formalized as classification and learning methods for classific...
PPSN
2000
Springer
15 years 1 months ago
2000
Springer
Domain knowledge is essential for successful problem solving and optimization. This paper introduces a framework in which a form of automatic domain knowledge extraction can be im...