Sciweavers

2372 search results - page 209 / 475
» Probabilistic calling context
Sort
View
141
Voted
CGF
2006
136views more  CGF 2006»
15 years 3 months ago
Cache-Efficient Layouts of Bounding Volume Hierarchies
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
Sung-Eui Yoon, Dinesh Manocha
CVIU
2006
317views more  CVIU 2006»
15 years 3 months ago
A general method for human activity recognition in video
In this paper we develop a system for human behaviour recognition in video sequences. Human behaviour is modelled as a stochastic sequence of actions. Actions are described by a f...
Neil Robertson, Ian D. Reid
JSAC
2008
98views more  JSAC 2008»
15 years 3 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
NN
2006
Springer
141views Neural Networks» more  NN 2006»
15 years 3 months ago
Encoding uncertainty in the hippocampus
The medial temporal lobe may play a critical role in binding successive events into memory while encoding contextual information in implicit and explicit memory tasks. Information...
Lee M. Harrison, Andrew Duggins, Karl J. Friston
COLING
2002
15 years 3 months ago
A Comparative Evaluation of Data-driven Models in Translation Selection of Machine Translation
We present a comparative evaluation of two data-driven models used in translation selection of English-Korean machine translation. Latent semantic analysis(LSA) and probabilistic ...
Yuseop Kim, Jeong Ho Chang, Byoung-Tak Zhang