Sciweavers

151 search results - page 13 / 31
» A Nonuniform Algorithm for the Hidden Number Problem in Subg...
Sort
View
FCT
2001
Springer
14 years 4 days ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
CDC
2009
IEEE
111views Control Systems» more  CDC 2009»
14 years 11 days ago
Minimal dynamical structure realisations with application to network reconstruction from data
— Network reconstruction, i.e., obtaining network structure from data, is a central theme in systems biology, economics, and engineering. Previous work introduced dynamical struc...
Ye Yuan, Guy-Bart Vincent Stan, Sean Warnick, Jorg...
COCO
1998
Springer
123views Algorithms» more  COCO 1998»
13 years 12 months ago
Isolation, Matching, and Counting
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Eric Allender, Klaus Reinhardt
TNN
2008
181views more  TNN 2008»
13 years 7 months ago
Optimized Approximation Algorithm in Neural Networks Without Overfitting
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...
Yinyin Liu, Janusz A. Starzyk, Zhen Zhu
ICANNGA
2007
Springer
153views Algorithms» more  ICANNGA 2007»
14 years 1 months ago
Automatic Design of ANNs by Means of GP for Data Mining Tasks: Iris Flower Classification Problem
This paper describes a new technique for automatically developing Artificial Neural Networks (ANNs) by means of an Evolutionary Computation (EC) tool, called Genetic Programming (G...
Daniel Rivero, Juan R. Rabuñal, Julian Dora...