Sciweavers

16430 search results - page 27 / 3286
» On Computable Tree Functions
Sort
View
RTA
2010
Springer
13 years 9 months ago
Underspecified computation of normal forms
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
Alexander Koller, Stefan Thater
DAGSTUHL
1994
13 years 9 months ago
Function-Based Object Recognition
Functionality-based recognition systems recognize objects at the category level by reasoning about how well the objects support the expected function. Such systems naturally assoc...
Louise Stark, Kevin W. Bowyer
ESA
1998
Springer
154views Algorithms» more  ESA 1998»
13 years 12 months ago
A Functional Approach to External Graph Algorithms
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
James Abello, Adam L. Buchsbaum, Jeffery Westbrook
ISNN
2005
Springer
14 years 1 months ago
Feature Selection and Intrusion Detection Using Hybrid Flexible Neural Tree
Current Intrusion Detection Systems (IDS) examine all data features to detect intrusion or misuse patterns. Some of the features may be redundant or contribute little (if anything)...
Yuehui Chen, Ajith Abraham, Ju Yang
GECCO
2010
Springer
129views Optimization» more  GECCO 2010»
14 years 14 days ago
A probabilistic functional crossover operator for genetic programming
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
Josh C. Bongard