Sciweavers

17 search results - page 2 / 4
» Heaviest Increasing Common Subsequence Problems
Sort
View
IDEAS
2007
IEEE
146views Database» more  IDEAS 2007»
13 years 11 months ago
Approximate Structural Matching over Ordered XML Documents
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen
RE
2004
Springer
13 years 10 months ago
Architecture-driven Problem Decomposition
Jackson’s Problem Frames provide a means of analysing and decomposing problems. They emphasise the world outside the computer helping the developer to focus on the problem domai...
Lucia Rapanotti, Jon G. Hall, Michael Jackson, Bas...
ICMLA
2008
13 years 6 months ago
Basis Function Construction in Reinforcement Learning Using Cascade-Correlation Learning Architecture
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
Sertan Girgin, Philippe Preux
UML
2005
Springer
13 years 10 months ago
Automated Analysis of Natural Language Properties for UML Models
It is well known that errors introduced early in the development process are commonly the most expensive to correct. The increasingly popular model-driven architecture (MDA) exace...
Sascha Konrad, Betty H. C. Cheng
NLPRS
2001
Springer
13 years 9 months ago
Statistical Parsing of Dutch using Maximum Entropy Models with Feature Merging
In this project report we describe work in statistical parsing using the maximum entropy technique and the Alpino language analysis system for Dutch. A major difficulty in this d...
Tony Mullen, Rob Malouf, Gertjan van Noord