Sciweavers

98 search results - page 16 / 20
» Finding Regular Simple Paths in Graph Databases
Sort
View
PKDD
2000
Springer
125views Data Mining» more  PKDD 2000»
13 years 11 months ago
Materialized Data Mining Views
Data mining is a useful decision support technique, which can be used to find trends and regularities in warehouses of corporate data. A serious problem of its practical applicatio...
Tadeusz Morzy, Marek Wojciechowski, Maciej Zakrzew...
AUTOMATICA
2008
92views more  AUTOMATICA 2008»
13 years 7 months ago
Generic uniform observability analysis for bilinear systems
In this paper, we study the property of generic uniform observability for structured bilinear systems. More precisely, to check whether or not a structured bilinear system generic...
T. Boukhobza
RECOMB
2004
Springer
14 years 7 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 17 days ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
RECOMB
2004
Springer
14 years 7 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...