4255 search results - page 333 / 851 » On Learning Boolean Functions |
200
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
279
click to vote
MST
2010
15 years 5 months ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
200
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...
196
click to vote
EOR
2011
15 years 1 months ago
2011
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
168
click to vote
DICTA
2007
15 years 8 months ago
2007
A scheme, named tower of knowledge (ToK), is proposed for interpreting 3D scenes. The ToK encapsulates causal dependencies between object appearance and functionality. We demonstr...