1146 search results - page 112 / 230 » Finite cupping sets |
AAAI
2000
13 years 11 months ago
2000
In recent years, there have been several proposals that extend the expressive power of Bayesian networks with that of relational models. These languages open the possibility for t...
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We identify the classical Perceptron algorithm with margin as a member of a broader family of large margin classifiers which we collectively call the Margitron. The Margitron, (des...
EJC
2010
13 years 10 months ago
2010
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...