8728 search results - page 251 / 1746 » On Reduct Construction Algorithms |
156
click to vote
IRI
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper we describe an approach to build XML schemas in a collaborative way. The approach is based on computing intersection between sequences of type terms built over const...
175
click to vote
FM
2003
Springer
15 years 12 months ago
2003
Springer
In this article, I present an “event approach” used to formally develop sequential programs. It is based on the formalism of Action Systems [6] (and Guarded Commands[7]), which...
172
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
150
click to vote
DLT
2008
15 years 8 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
167
click to vote
COLING
1996
15 years 8 months ago
1996
The paper describes a system which uses packed parser output directly to build semantic representations. More specifically, the system takes as input Packed Shared Forests in the ...