Sciweavers

85 search results - page 9 / 17
» State-transition machines, revisited
Sort
View
ECML
2006
Springer
15 years 1 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
CSL
2010
Springer
14 years 10 months ago
Exact Exploration and Hanging Algorithms
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
ICML
2007
IEEE
15 years 10 months ago
Revisiting probabilistic models for clustering with pair-wise constraints
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints between data points. We evaluate and compare existing techniques in terms of robust...
Blaine Nelson, Ira Cohen
ISORC
2009
IEEE
15 years 4 months ago
From Requirements to Code Revisited
In his article entitled "From Play-In Scenarios to Code: An Achievable Dream", David Harel presented a development schema that makes it possible to go from high-level us...
Tewfik Ziadi, Xavier Blanc, Amine Raji
EC
2007
101views ECommerce» more  EC 2007»
14 years 9 months ago
Revisiting Negative Selection Algorithms
This paper reviews the progress of negative selection algorithms, an anomaly/change detection approach in Artificial Immune Systems (AIS). Following its initial model, we try to ...
Zhou Ji, Dipankar Dasgupta