Sciweavers

741 search results - page 84 / 149
» A Markov random field model for term dependencies
Sort
View
DAC
2005
ACM
15 years 10 months ago
Designing logic circuits for probabilistic computation in the presence of noise
As Si CMOS devices are scaled down into the nanoscale regime, current computer architecture approaches are reaching their practical limits. Future nano-architectures will confront...
Kundan Nepal, R. Iris Bahar, Joseph L. Mundy, Will...
PE
2010
Springer
170views Optimization» more  PE 2010»
14 years 8 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
NIPS
2003
14 years 11 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
ICMCS
2007
IEEE
151views Multimedia» more  ICMCS 2007»
15 years 4 months ago
Exploring Contextual Information in a Layered Framework for Group Action Recognition
Contextual information is important for sequence modeling. Hidden Markov Models (HMMs) and extensions, which have been widely used for sequence modeling, make simplifying, often u...
Dong Zhang, Samy Bengio
AAMAS
2010
Springer
14 years 10 months ago
A probabilistic multimodal approach for predicting listener backchannels
During face-to-face interactions, listeners use backchannel feedback such as head nods as a signal to the speaker that the communication is working and that they should continue sp...
Louis-Philippe Morency, Iwan de Kok, Jonathan Grat...