Sciweavers

69 search results - page 1 / 14
» Efficient evaluation of radial queries using the target tree
Sort
View
IJBRA
2007
36views more  IJBRA 2007»
13 years 4 months ago
Efficient evaluation of radial queries using the target tree
Michael D. Morse, Jignesh M. Patel, William I. Gro...
BMCBI
2006
72views more  BMCBI 2006»
13 years 4 months ago
Selecting effective siRNA sequences by using radial basis function network and decision tree learning
Background: Although short interfering RNA (siRNA) has been widely used for studying gene functions in mammalian cells, its gene silencing efficacy varies markedly and there are o...
Shigeru Takasaki, Yoshihiro Kawamura, Akihiko Kona...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 4 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
NIPS
1990
13 years 5 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 4 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder