11716 search results - page 399 / 2344 » Computable symbolic dynamics |
185
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
192
click to vote
CONCUR
2000
Springer
15 years 10 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
197
click to vote
ICCV
1995
IEEE
15 years 10 months ago
1995
IEEE
We propose a shape representation scheme which allows two shapes to be combined into a single model. The desired regions of the two shapes are selected, and then merged together f...
181
click to vote
PSLS
1995
15 years 10 months ago
1995
Abstract. Lazy task creation (LTC) is an e cient approach for executing divide and conquer parallel programs that has been used in the implementation of Multilisp's future con...
239
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...