1139 search results - page 172 / 228 » Bounded Ideation Theory |
SAS
2001
Springer
14 years 6 days ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
FGR
2000
IEEE
14 years 5 days ago
2000
IEEE
Colorhasbeen widelyused for handsegmentation. However, many approaches rely on predefined skin color models. It is very difficult to predefine a color model in a mobile applica...
CSFW
1999
IEEE
14 years 2 days ago
1999
IEEE
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
CADE
1998
Springer
14 years 6 hour ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
COLT
1994
Springer
13 years 12 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...