412 search results - page 56 / 83 » A New Proof of the F5 Algorithm |
AAECC
2005
Springer
14 years 9 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
MMSEC
2006
ACM
15 years 3 months ago
2006
ACM
Current zero-knowledge watermark detectors are based on a linear correlation between the asset features and a given secret sequence. This detection function is susceptible of bein...
LPKR
1997
Springer
15 years 2 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
TCC
2007
Springer
15 years 4 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
We propose a family of novel cost-sensitive boosting methods for multi-class classification by applying the theory of gradient boosting to p-norm based cost functionals. We establ...