Sciweavers

1404 search results - page 44 / 281
» Complexity of admissible rules
Sort
View
LOPSTR
1994
Springer
14 years 2 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
CVPR
1998
IEEE
15 years 9 days ago
Generation of the Euclidean Skeleton from the Vector Distance Map by a Bisector Decision Rule
The Euclidean skeleton is essential for general shape representation. This paper provides an e cient method to extract a well-connected Euclidean skeleton by a neighbor bisector d...
Hong Li, Albert M. Vossepoel
ICML
2005
IEEE
14 years 11 months ago
Fast condensed nearest neighbor rule
We present a novel algorithm for computing a training set consistent subset for the nearest neighbor decision rule. The algorithm, called FCNN rule, has some desirable properties....
Fabrizio Angiulli
GG
2004
Springer
14 years 3 months ago
Rule Execution in Graph-Based Incremental Interactive Integration Tools
Abstract. Development processes in engineering disciplines are inherently complex. Throughout the development process, different kinds of inter-dependent design documents are creat...
Simon M. Becker, Sebastian Lohmann, Bernhard Westf...
KES
2004
Springer
14 years 3 months ago
Multi-agent Web Recommendation Method Based on Indirect Association Rules
Recommendation systems often use association rules as main technique to discover useful links among the set of transactions, especially web usage data – historical user sessions....
Przemyslaw Kazienko