Result 1 to 20 of 91 total
Hydras: directed hypergraphs and Horn formulas. (English)
Golumbic, Martin Charles (ed.) et al., Graph-theoretic concepts in computer science. 38th international workshop, WG 2012, Jerusalem, Israel, June 26‒28, 2012. Revised selcted papers. Berlin: Springer (ISBN 978-3-642-34610-1/pbk). Lecture Notes in Computer Science 7551, 237-248 (2012).
1
On multiple-instance learning of halfspaces. (English)
Inf. Process. Lett. 112, No. 23, 933-936 (2012).
2
A three-dimensional positioning algorithm for networked wireless sensors (English)
IEEE T. Instrumentation and Measurement 60, No. 4, 1423-1432 (2011).
3
Horn upper bounds and renaming. (English)
J. Satisf. Boolean Model. Comput. 7, No. 1, 1-15 (2010).
4
Choreographing emotional facial expressions. (English)
Comput. Animat. Virtual Worlds 21, No. 3-4, 203-213 (2010).
5
Learning Boolean functions with queries. (English)
Crama, Yves (ed.) et al., Boolean models and methods in mathematics, computer science, and engineering. Cambridge: Cambridge University Press (ISBN 978-0-521-84752-0/hbk). Encyclopedia of Mathematics and its Applications 134, 221-256 (2010).
6
Reinforcement learning via approximation of the Q-function. (English)
J. Exp. Theor. Artif. Intell. 22, No. 3, 219-235 (2010).
7
Reinforcement learning via approximation of the Q-function (English)
J. Exp. Theor. Artif. Intell. 22, No. 3, 219-235 (2010).
8
Horn upper bounds and renaming (English)
JSAT 7, No. 1, 1-15 (2010).
9
Combinatorial problems for Horn clauses. (English)
Lipshteyn, Marina (ed.) et al., Graph theory, computational intelligence and thought. Essays dedicated to Martin Charles Golumbic on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-02028-5/pbk). Lecture Notes in Computer Science 5420, 54-65 (2009).
10
Combinatorial problems for Horn clauses (English)
Graph Theory, Computational Intelligence and Thought, 54-65 (2009).
11
Projective DNF formulae and their revision. (English)
Discrete Appl. Math. 156, No. 4, 530-544 (2008).
12
Curriculum update from the ACM education board: CS2008 and a report on masters degrees (English)
SIGCSE, 530-531 (2008).
13
CS 0.5: a better approach to introductory computer science for majors (English)
SIGCSE, 271-275 (2008).
14
Horn complements: towards Horn-to-Horn belief revision (English)
AAAI, 466-471 (2008).
15
Horn upper bounds and renaming. (English)
Marques-Silva, João (ed.) et al., Theory and applications of satisfiability testing ‒ SAT 2007. 10th international conference, Lisbon, Portugal, May 28‒31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72787-3/pbk). Lecture Notes in Computer Science 4501, 80-93 (2007).
16
On $k$-term DNF with the largest number of prime implicants. (English)
SIAM J. Discrete Math. 21, No. 4, 987-998 (2007).
17
Revising threshold functions. (English)
Theor. Comput. Sci. 382, No. 3, 198-208 (2007).
18
The inverse protein folding problem on 2D and 3D lattices. (English)
Discrete Appl. Math. 155, No. 6-7, 719-732 (2007).
19
The joys of being an NSF program director (English)
SIGACT News 38, No. 1, 7-8 (2007).
20
Result 1 to 20 of 91 total
Start
Contact
Print
General Help
