Sciweavers

111 search results - page 5 / 23
» Testing Input Output Partial Order Automata
Sort
View
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
14 years 2 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert
CONCUR
1994
Springer
13 years 12 months ago
Composition and Behaviors of Probabilistic I/O Automata
We augment the I/O automaton model of Lynch and Tuttle with probability, as a step toward the ultimate goal of obtaining a useful tool for specifying and reasoning about asynchron...
Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark
FASE
2008
Springer
13 years 9 months ago
Regular Inference for State Machines Using Domains with Equality Tests
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Therese Berg, Bengt Jonsson, Harald Raffelt
SODA
1990
ACM
49views Algorithms» more  SODA 1990»
13 years 9 months ago
Factor Refinement
Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial tim...
Eric Bach, James R. Driscoll, Jeffrey Shallit
ACSE
1997
ACM
13 years 12 months ago
I/O considered harmful (at least for the first few weeks)
One of the major difficulties with teaching the first programming course is input/output. It is desirable to show students how to input data and output results early in the course...
John Rosenberg, Michael Kölling