Sciweavers

957 search results - page 26 / 192
» Addition Chain Heuristics
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Optimal structure of memory models for lossless compression of binary image contours
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
Ioan Tabus, Septimia Sarbu
CDC
2008
IEEE
125views Control Systems» more  CDC 2008»
14 years 4 months ago
Estimation of non-stationary Markov Chain transition models
— Many decision systems rely on a precisely known Markov Chain model to guarantee optimal performance, and this paper considers the online estimation of unknown, nonstationary Ma...
Luca F. Bertuccelli, Jonathan P. How
ML
2002
ACM
246views Machine Learning» more  ML 2002»
13 years 9 months ago
Bayesian Clustering by Dynamics
This paper introduces a Bayesian method for clustering dynamic processes. The method models dynamics as Markov chains and then applies an agglomerative clustering procedure to disc...
Marco Ramoni, Paola Sebastiani, Paul R. Cohen
DCC
2005
IEEE
14 years 9 months ago
A Point-Set Compression Heuristic for Fiber-Based Certificates of Authenticity
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
Darko Kirovski
APPROX
2004
Springer
125views Algorithms» more  APPROX 2004»
14 years 3 months ago
Strong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
Amin Coja-Oghlan, Andreas Goerdt, André Lan...