Sciweavers

1641 search results - page 10 / 329
» Termination Analysis with Algorithmic Learning
Sort
View
PR
2006
76views more  PR 2006»
14 years 9 months ago
Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints
Relevant component analysis (RCA) is a recently proposed metric learning method for semi-supervised learning applications. It is a simple and efficient method that has been applie...
Dit-Yan Yeung, Hong Chang
AAAI
1996
14 years 10 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker
103
Voted
ICML
2007
IEEE
15 years 10 months ago
Non-isometric manifold learning: analysis and an algorithm
In this work we take a novel view of nonlinear manifold learning. Usually, manifold learning is formulated in terms of finding an embedding or `unrolling' of a manifold into ...
Piotr Dollár, Serge J. Belongie, Vincent Ra...
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
14 years 9 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
CSFW
1999
IEEE
15 years 1 months ago
Decision Procedures for the Analysis of Cryptographic Protocols by Logics of Belief
Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In addition to the familiar BAN logic, it is also applicab...
David Monniaux