Sciweavers

58 search results - page 6 / 12
» On Finding Acyclic Subhypergraphs
Sort
View
IJCAI
1993
15 years 4 months ago
A Tractable Class of Abduction Problems
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
Kave Eshghi
ICPR
2008
IEEE
16 years 4 months ago
On efficient Viterbi decoding for hidden semi-Markov models
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
Bonnie K. Ray, Jianying Hu, Ritendra Datta
UAI
2008
15 years 4 months ago
Learning Inclusion-Optimal Chordal Graphs
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
Vincent Auvray, Louis Wehenkel
JALC
2002
97views more  JALC 2002»
15 years 2 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
ASP
2003
Springer
15 years 8 months ago
Outlier Detection Using Default Logic
Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic for detecting outliers - individuals who behave in a...
Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Luig...