Sciweavers

1763 search results - page 285 / 353
» A Formalization of Polytime Functions
Sort
View
EDBT
1998
ACM
105views Database» more  EDBT 1998»
15 years 2 months ago
Equal Time for Data on the Internet with WebSemantics
Many collections of scienti c data in particular disciplines are available today around the world. Much of this data conforms to some agreed upon standard for data exchange, i.e., ...
George A. Mihaila, Louiqa Raschid, Anthony Tomasic
LACL
1998
Springer
15 years 2 months ago
Strict Compositionality and Literal Movement Grammars
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
Marcus Kracht
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
15 years 2 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...
PPSN
1998
Springer
15 years 2 months ago
On Genetic Algorithms and Lindenmayer Systems
This paper describes a system for simulating the evolution of artificial 2D plant morphologies. Virtual plant genotypes are inspired by the mathematical formalism known as Lindenma...
Gabriela Ochoa
ICFP
1997
ACM
15 years 2 months ago
Foundations for the Implementation of Higher-Order Subtyping
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
Karl Crary