Sciweavers

4095 search results - page 274 / 819
» How to test a tree
Sort
View
IJCAI
2007
15 years 2 months ago
Extracting Propositional Rules from Feed-forward Neural Networks - A New Decompositional Approach
In this paper, we present a new decompositional approach for the extraction of propositional rules from feed-forward neural networks of binary threshold units. After decomposing t...
Sebastian Bader, Steffen Hölldobler, Valentin...
91
Voted
BXML
2004
15 years 2 months ago
Binary Queries and XML Transformations
: We present a grammar-based approach to specifying k-ary queries for XML documents. k-ary queries simultaneously locate k nodes of an input tree as specified by a given relation. ...
Alexandru Berlea
96
Voted
GAMEON
2001
15 years 2 months ago
A New Computational Approach to the Game of Go
This paper investigates the application of neural network techniques to the creation of a program that can play the game of Go with some degree of success. The combination of soft...
Julian Churchill, Richard Cant, David Al-Dabass
79
Voted
IPL
2008
95views more  IPL 2008»
15 years 20 days ago
Distortion lower bounds for line embeddings
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
Claire Mathieu, Charalampos Papamanthou
90
Voted
IJISTA
2007
88views more  IJISTA 2007»
15 years 18 days ago
Event triggered Holonic organisation formation
: Internet based distributed collaborative commerce must resolve two problems first. One is what organisation shape is and the other is how to establish an efficient and active org...
Mingwei Yuan, Ping Jiang, Zuren Feng