154 search results - page 25 / 31 » Equivalence Problems for Circuits over Sets of Natural Numbe... |
CAV
1999
Springer
13 years 12 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
IDA
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of learning a ranking function, that is a mapping from instances to rankings over a finite number of labels. Our learning method, referred to as ranking by...
ICIP
2009
IEEE
14 years 8 months ago
2009
IEEE
In this work, we propose algorithms to recursively and causally reconstruct a sequence of natural images from a reduced number of linear projection measurements taken in a domain ...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...