1819 search results - page 105 / 364 » Computability and Representations of the Zero Set |
CANDC
2009
ACM
15 years 4 months ago
2009
ACM
We present a sub-symbolic computational model for effecting knowledge re-representation and insight. Given a set of data, manifold learning is used to automatically organize the d...
127
click to vote
ECCC
2011
14 years 4 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
CONCUR
2005
Springer
15 years 3 months ago
2005
Springer
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models...
SAC
1994
ACM
15 years 2 months ago
1994
ACM
In this paper, the interest of fuzzy sets and possibility theory in the context of databases is presented. It is shown that these " notions provide an homogeneous framework f...