Sciweavers

160 search results - page 25 / 32
» re 2007
Sort
View
IJCAI
1997
13 years 8 months ago
Extracting Propositions from Trained Neural Networks
This paper presents an algorithm for extract­ ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
Hiroshi Tsukimoto
IJCAI
1993
13 years 8 months ago
Learning Finite Automata Using Local Distinguishing Experiments
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
Wei-Mein Shen
JGTOOLS
2007
119views more  JGTOOLS 2007»
13 years 7 months ago
PB-FFD: A Point-Based Technique for Free-Form Deformation
This paper presents PB-FFD, a novel, interactive, point-based technique for performing free-form deformation of polygonal meshes. First, a volumetric deformation space is de ned a...
Kevin T. McDonnell, Hong Qin
NN
2007
Springer
103views Neural Networks» more  NN 2007»
13 years 7 months ago
Emergence of sequence sensitivity in a hippocampal CA3-CA1 model
Recent studies have shown that place cells in the hippocampal CA1 region fire in a sequence sensitive manner. In this study we tested if hippocampal CA3 and CA1 regions can give ...
Motoharu Yoshida, Hatsuo Hayashi
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 8 months ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu