Sciweavers

301 search results - page 36 / 61
» Probabilistic rough set approximations
Sort
View
MICAI
2005
Springer
15 years 4 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...
ESOP
2011
Springer
14 years 2 months ago
Measure Transformer Semantics for Bayesian Machine Learning
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
Johannes Borgström, Andrew D. Gordon, Michael...
ICDCS
2006
IEEE
15 years 5 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ISBI
2011
IEEE
14 years 2 months ago
Exact integration of diffusion orientation distribution functions for graph-based diffusion MRI analysis
Graph-based image analysis methods are increasingly being applied to diffusion MRI (dMRI) analysis. Unfortunately, weighting the graph for these methods involves solving a complex...
Brian G. Booth, Ghassan Hamarneh
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
14 years 9 months ago
Simulation-based LQR-trees with input and state constraints
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
Philipp Reist, Russ Tedrake