192 search results - page 18 / 39 » Boolean Matching Using Generalized Reed-Muller Forms |
111
click to vote
ECCC
2007
15 years 2 months ago
2007
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
SIGIR
2003
ACM
15 years 8 months ago
2003
ACM
We will present a novel two-step fuzzy translation technique for cross-lingual spelling variants. In the first stage, transformation rules are applied to source words to render th...
113
click to vote
DLOG
2008
15 years 5 months ago
2008
A fundamental requirement for cooperating agents is to agree on a selection of component values of objects that can be used for reliably communicating references to the objects, to...
122
Voted
AI
2011
Springer
14 years 10 months ago
2011
Springer
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
122
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...