Sciweavers

1998 search results - page 331 / 400
» Complexity of the Cover Polynomial
Sort
View
ICLP
1999
Springer
14 years 3 months ago
Computing Large and Small Stable Models
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
Miroslaw Truszczynski
HYBRID
1998
Springer
14 years 3 months ago
High Order Eigentensors as Symbolic Rules in Competitive Learning
We discuss properties of high order neurons in competitive learning. In such neurons, geometric shapes replace the role of classic `point' neurons in neural networks. Complex ...
Hod Lipson, Hava T. Siegelmann
ISAAC
1998
Springer
72views Algorithms» more  ISAAC 1998»
14 years 3 months ago
Casting with Skewed Ejection Direction
Casting is a manufacturing process in which liquid is poured into a cast (mould) that has a cavity with the shape of the object to be manufactured. The liquid then hardens, after ...
Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong
ALT
1997
Springer
14 years 3 months ago
Learning DFA from Simple Examples
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
Rajesh Parekh, Vasant Honavar
CP
1997
Springer
14 years 3 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...