4255 search results - page 494 / 851 » On Learning Boolean Functions |
171
click to vote
COCO
2005
Springer
16 years 7 days ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
146
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
176
click to vote
TREC
2004
15 years 8 months ago
2004
The TREC 2004 Terabyte Track evaluated information retrieval in largescale text collections, using a set of 25 million documents (426 GB). This paper gives an overview of our expe...
305
click to vote
AIEDAM
2011
15 years 1 months ago
2011
In familiar design domains, expert designers are able to quickly focus on “good designs”, based on constraints they have learned while exploring the design space. This ability ...
200
click to vote
SAC
2003
ACM
15 years 12 months ago
2003
ACM
The construction of a text classifier usually involves (i) a phase of term selection, in which the most relevant terms for the classification task are identified, (ii) a phase ...