Sciweavers

17983 search results - page 45 / 3597
» Set Types and Applications
Sort
View
114
Voted
ISMIS
1999
Springer
15 years 6 months ago
Applications and Research Problems of Subgroup Mining
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
Willi Klösgen
DEXA
1994
Springer
92views Database» more  DEXA 1994»
15 years 6 months ago
OR-SML: A Functional Database Programming Language for Disjunctive Information and Its Applications
We describe a functional database language OR-SML for handling disjunctive information in database queries, and its implementation on top of Standard ML 12]. The core language has ...
Elsa L. Gunter, Leonid Libkin
131
Voted
COLING
2002
15 years 2 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
DLOG
2003
15 years 3 months ago
Wine Agent: Semantic Web Testbed Application
The Wine Agent is a demonstration system that uses an underlying domain ontology to provide suitable wines for a given meal. In doing so it serves as a testbed, not only for the l...
Eric I. Hsu, Deborah L. McGuinness
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
15 years 6 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt