Sciweavers

119 search results - page 2 / 24
» Exploring the Regular Tree Types
Sort
View
DBPL
2005
Springer
135views Database» more  DBPL 2005»
13 years 10 months ago
Type-Based Optimization for Regular Patterns
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
Michael Y. Levin, Benjamin C. Pierce
CIMCA
2008
IEEE
13 years 11 months ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis
IFIP
2004
Springer
13 years 10 months ago
Regular Tree Language Recognition with Static Information
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...
Alain Frisch
SDM
2008
SIAM
197views Data Mining» more  SDM 2008»
13 years 6 months ago
A general framework for estimating similarity of datasets and decision trees: exploring semantic similarity of decision trees
Decision trees are among the most popular pattern types in data mining due to their intuitive representation. However, little attention has been given on the definition of measure...
Irene Ntoutsi, Alexandros Kalousis, Yannis Theodor...
PPDP
2001
Springer
13 years 9 months ago
Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
Franklyn A. Turbak, J. B. Wells