Sciweavers

838 search results - page 38 / 168
» Propagation Redundancy in Redundant Modelling
Sort
View
ICPR
2004
IEEE
14 years 10 months ago
A Rival Penalized EM Algorithm towards Maximizing Weighted Likelihood for Density Mixture Clustering with Automatic Model Select
How to determine the number of clusters is an intractable problem in clustering analysis. In this paper, we propose a new learning paradigm named Maximum Weighted Likelihood (MwL)...
Yiu-ming Cheung
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
14 years 2 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson
ICLP
1997
Springer
14 years 1 months ago
Solving Small TSPs with Constraints
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
Yves Caseau, François Laburthe
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 9 months ago
An Optimization for Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
Cristina Feier, Stijn Heymans
CL
2000
Springer
14 years 2 months ago
Promoting Constraints to First-Class Status
Abstract. This paper proposes to promote constraints to first-class status. In contrast to constraint propagation, which performs inference on values of variables, first-class co...
Tobias Müller