Sciweavers

2372 search results - page 123 / 475
» Probabilistic calling context
Sort
View
ENTCS
2007
123views more  ENTCS 2007»
13 years 10 months ago
Labelled Markov Processes as Generalised Stochastic Relations
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an associated probability. In this paper we present a universal LMP as the spectrum o...
Michael W. Mislove, Dusko Pavlovic, James Worrell
WS
2008
ACM
13 years 10 months ago
Managing uncertainty and vagueness in description logics for the Semantic Web
Ontologies play a crucial role in the development of the Semantic Web as a means for defining shared terms in web resources. They are formulated in web ontology languages, which a...
Thomas Lukasiewicz, Umberto Straccia
NAACL
2010
13 years 8 months ago
Variational Inference for Adaptor Grammars
Adaptor grammars extend probabilistic context-free grammars to define prior distributions over trees with "rich get richer" dynamics. Inference for adaptor grammars seek...
Shay B. Cohen, David M. Blei, Noah A. Smith
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 5 months ago
Probability Based Clustering for Document and User Properties
Information Retrieval systems can be improved by exploiting context information such as user and document features. This article presents a model based on overlapping probabilistic...
Thomas Mandl, Christa Womser-Hacker
LAWEB
2003
IEEE
14 years 3 months ago
The Best Trail Algorithm for Assisted Navigation of Web Sites
We present an algorithm called the Best Trail Algorithm, which helps solve the hypertext navigation problem by automating the construction of memex-like trails through the corpus....
Richard Wheeldon, Mark Levene