Sciweavers

774 search results - page 74 / 155
» Markov incremental constructions
Sort
View
ICTAI
2005
IEEE
14 years 2 months ago
An Adaptive De-Blocking Algorithm Based on MRF
One of the major drawbacks in block-based discrete cosine transform (BDCT) is the blocking artifacts at low bit rates. In this paper, an adaptive deblocking algorithm based on Mar...
Shengli Xie, Zhiliang Xu
ICANN
2005
Springer
14 years 2 months ago
Implicit Relevance Feedback from Eye Movements
We explore the use of eye movements as a source of implicit relevance feedback information. We construct a controlled information retrieval experiment where the relevance of each t...
Jarkko Salojärvi, Kai Puolamäki, Samuel ...
ESANN
2007
13 years 10 months ago
Visualisation of tree-structured data through generative probabilistic modelling
We present a generative probabilistic model for the topographic mapping of tree structured data. The model is formulated as constrained mixture of hidden Markov tree models. A nat...
Nikolaos Gianniotis, Peter Tino
NIPS
2003
13 years 10 months ago
An MCMC-Based Method of Comparing Connectionist Models in Cognitive Science
Despite the popularity of connectionist models in cognitive science, their performance can often be difficult to evaluate. Inspired by the geometric approach to statistical model ...
Woojae Kim, Daniel J. Navarro, Mark A. Pitt, In Ja...
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 9 months ago
Efficient Implementation of the Generalized Tunstall Code Generation Algorithm
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
Michael B. Baer