Sciweavers

12257 search results - page 2220 / 2452
» Analysis of Algorithms
Sort
View
138
Voted
MATES
2010
Springer
15 years 2 months ago
Do You Get It? User-Evaluated Explainable BDI Agents
Abstract. In this paper we focus on explaining to humans the behavior of autonomous agents, i.e., explainable agents. Explainable agents are useful for many reasons including scena...
Joost Broekens, Maaike Harbers, Koen V. Hindriks, ...
105
Voted
MICCAI
2010
Springer
15 years 2 months ago
Probabilistic Anatomical Connectivity Using Completion Fields
Abstract. Diffusion magnetic resonance imaging has led to active research in the analysis of anatomical connectivity in the brain. Many approaches have been proposed to model the ...
Parya MomayyezSiahkal, Kaleem Siddiqi
MST
2010
98views more  MST 2010»
15 years 2 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
114
Voted
PAMI
2010
192views more  PAMI 2010»
15 years 2 months ago
Esaliency (Extended Saliency): Meaningful Attention Using Stochastic Image Modeling
Computer-vision attention processes allocate computational resources to different parts of visual input and can lead to faster object recognition and image analysis. This paper p...
Tamar Avraham, Michael Lindenbaum
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 2 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
« Prev « First page 2220 / 2452 Last » Next »