Sciweavers

3708 search results - page 244 / 742
» Approximating Betweenness Centrality
Sort
View
CCCG
2010
15 years 8 months ago
Fast local searches and updates in bounded universes
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
ESANN
2007
15 years 8 months ago
Agglomerative Independent Variable Group Analysis
Independent Variable Group Analysis (IVGA) is a method for grouping dependent variables together while keeping mutually independent or weakly dependent variables in separate group...
Antti Honkela, Jeremias Seppä, Esa Alhoniemi
AAAI
2006
15 years 8 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
VMV
2004
103views Visualization» more  VMV 2004»
15 years 8 months ago
Hardware-accelerated ambient occlusion computation
In this paper, we present a novel, hardwareaccelerated approach to compute the visibility between surface points and directional light sources. Thus, our method provides a first-o...
Mirko Sattler, Ralf Sarlette, Gabriel Zachmann, Re...
UAI
1996
15 years 8 months ago
Asymptotic Model Selection for Directed Networks with Hidden Variables
We extend the Bayesian Information Criterion (BIC), an asymptotic approximation for the marginal likelihood, to Bayesian networks with hidden variables. This approximation can be ...
Dan Geiger, David Heckerman, Christopher Meek