542 citations
- J. Ryckebusch2 profiles23 · h 30
- D. Ryckbosch3 profiles21 · h 131
- D. Dudal19 · h 37
- H. Verschelde17 · h 35
- M. Baes3 profiles17 · h 64
- E. Bernardini2 profiles15 · h 93
- H. Dejonghe15 · h 32
- S. P. Sorella2 profiles15 · h 33
- D. Besson4 profiles13 · h 82
- S. D. Rijcke13 · h 24
- A. Goldschmidt3 profiles12 · h 83
- A. Groß3 profiles12 · h 54
- Centre National de la Recherche ScientifiqueFR19 papers
- University of California, IrvineUS18 papers
- University of OxfordGB17 papers
- Johannes Gutenberg University MainzDE16 papers
- Universidade do Estado do Rio de JaneiroBR16 papers
- Vrije Universiteit BrusselBE16 papers
- Université Libre de BruxellesBE15 papers
- University of GlasgowGB15 papers
- University of BonnDE14 papers
- University of Maryland, College ParkUS14 papers
- Lawrence Berkeley National LaboratoryUS13 papers
- RWTH Aachen UniversityDE13 papers
Showing 2012 · cs.AIShow all
3 papers · 2 filters
cs.AI2012
An efficient algorithm for estimating state sequences in imprecise hidden Markov models
Jasper De Bock, Gert de Cooman
We present an efficient exact algorithm for estimating state sequences from outputs (or observations) in imprecise hidden Markov models (iHMM), where both the uncertainty linking o…
cs.AI2012★ 5 cited
Characterizing the Set of Coherent Lower Previsions with a Finite Number of Constraints or Vertices
Erik Quaeghebeur
The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite…
cs.AI2012★ 26 cited
Possibilistic Answer Set Programming Revisited
Kim Bauters, Steven Schockaert, Martine De Cock +1
Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an appli…