Sciweavers

581 search results - page 10 / 117
» An Automata Model for Trees with Ordered Data Values
Sort
View
ICDT
2003
ACM
126views Database» more  ICDT 2003»
15 years 2 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
EOR
2006
130views more  EOR 2006»
14 years 9 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
NAR
2006
156views more  NAR 2006»
14 years 9 months ago
VOMBAT: prediction of transcription factor binding sites using variable order Bayesian trees
Variable order Markov models and variable order Bayesian trees have been proposed for the recognition of transcription factor binding sites, and it could be demonstrated that they...
Jan Grau, Irad E. Ben-Gal, Stefan Posch, Ivo Gross...
AINA
2008
IEEE
15 years 4 months ago
Missing Value Estimation for Time Series Microarray Data Using Linear Dynamical Systems Modeling
The analysis of gene expression time series obtained from microarray experiments can be effectively exploited to understand a wide range of biological phenomena from the homeostat...
Connie Phong, Raul Singh
ICML
2002
IEEE
15 years 10 months ago
Kernels for Semi-Structured Data
Semi-structured data such as XML and HTML is attracting considerable attention. It is important to develop various kinds of data mining techniques that can handle semistructured d...
Hisashi Kashima, Teruo Koyanagi