Sciweavers

1376 search results - page 207 / 276
» Searching Trees: An Essay
Sort
View
IJCAI
1997
15 years 7 months ago
Minimum Splits Based Discretization for Continuous Features
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...
Ke Wang, Han Chong Goh
SEBD
1997
158views Database» more  SEBD 1997»
15 years 7 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...
ACL
1996
15 years 7 months ago
A New Statistical Parser Based on Bigram Lexical Dependencies
This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniqu...
Michael Collins
ICGA
1993
145views Optimization» more  ICGA 1993»
15 years 7 months ago
Genetic Programming of Minimal Neural Nets Using Occam's Razor
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...
Byoung-Tak Zhang, Heinz Mühlenbein
MVA
1990
101views Computer Vision» more  MVA 1990»
15 years 7 months ago
Recognition of Parametrised Models from 3D Data
This paper describes work done as part of the Oxford AGV (Autonomous Guided Vehicle) project [2] towards recognition of classes of objects to be encountered in a factory environme...
Ian D. Reid