Sciweavers

1594 search results - page 84 / 319
» Fast Prediction on a Tree
Sort
View
NIPS
2003
13 years 9 months ago
Applying Metric-Trees to Belief-Point POMDPs
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
EUROMICRO
2006
IEEE
14 years 2 months ago
Towards Ethernet-Based Wireless Mesh Networks for Fast Moving Users
In this paper we examine the capabilities of Switched Ethernet for building wireless mesh networks (WMNs) and more specific for the support of fast moving users. We will motivate...
Filip De Greve, Wim Vandenberghe, Filip De Turck, ...
JMLR
2010
141views more  JMLR 2010»
13 years 2 months ago
FastInf: An Efficient Approximate Inference Library
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
Ariel Jaimovich, Ofer Meshi, Ian McGraw, Gal Elida...
ICML
2005
IEEE
14 years 8 months ago
Compact approximations to Bayesian predictive distributions
We provide a general framework for learning precise, compact, and fast representations of the Bayesian predictive distribution for a model. This framework is based on minimizing t...
Edward Snelson, Zoubin Ghahramani
ICML
2010
IEEE
13 years 9 months ago
Fast Neighborhood Subgraph Pairwise Distance Kernel
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...
Fabrizio Costa, Kurt De Grave