Sciweavers

1594 search results - page 199 / 319
» Fast Prediction on a Tree
Sort
View
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
15 years 11 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
15 years 11 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
CIC
2004
118views Communications» more  CIC 2004»
14 years 11 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
CORR
2010
Springer
209views Education» more  CORR 2010»
14 years 10 months ago
An Algorithm to Extract Rules from Artificial Neural Networks for Medical Diagnosis Problems
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...
S. M. Kamruzzaman, Md. Monirul Islam
CORR
2011
Springer
151views Education» more  CORR 2011»
14 years 5 months ago
A supervised clustering approach for fMRI-based inference of brain states
We propose a method that combines signals from many brain regions observed in functional Magnetic Resonance Imaging (fMRI) to predict the subject’s behavior during a scanning se...
Vincent Michel, Alexandre Gramfort, Gaël Varo...