192 search results - page 12 / 39 » Boolean Matching Using Generalized Reed-Muller Forms |
206
click to vote
SIGIR
2012
ACM
13 years 2 months ago
2012
ACM
People are seldom aware that their search queries frequently mismatch a majority of the relevant documents. This may not be a big problem for topics with a large and diverse set o...
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
This paper considers a method for learning a distance metric in a fingerprinting system which identifies a query content by measuring the distance between the fingerprint of th...
SIGMOD
2008
ACM
14 years 11 months ago
2008
ACM
Today's record matching infrastructure does not allow a flexible way to account for synonyms such as "Robert" and "Bob" which refer to the same name, and ...
105
click to vote
SIGMOD
2001
ACM
15 years 11 months ago
2001
ACM
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
126
click to vote
SIAMCOMP
2011
14 years 6 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...