Sciweavers

1150 search results - page 105 / 230
» Tackling Large State Spaces in Performance Modelling
Sort
View
TIT
2010
153views Education» more  TIT 2010»
14 years 10 months ago
On the information rates of the plenoptic function
The plenoptic function (Adelson and Bergen, 91) describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) a...
Arthur L. da Cunha, Minh N. Do, Martin Vetterli
IJCAI
2001
15 years 5 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
16 years 4 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
ICML
2007
IEEE
16 years 4 months ago
Three new graphical models for statistical language modelling
The supremacy of n-gram models in statistical language modelling has recently been challenged by parametric models that use distributed representations to counteract the difficult...
Andriy Mnih, Geoffrey E. Hinton
IJON
2000
76views more  IJON 2000»
15 years 3 months ago
Fast neural network simulations with population density methods
The complexity of neural networks of the brain makes studying these networks through computer simulation challenging. Conventional methods, where one models thousands of individua...
Duane Q. Nykamp, Daniel Tranchina