Sciweavers

1778 search results - page 264 / 356
» On the Power of the Randomized Iterate
Sort
View
UAI
2008
15 years 7 months ago
Tightening LP Relaxations for MAP using Message Passing
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
David Sontag, Talya Meltzer, Amir Globerson, Tommi...
VIIP
2001
15 years 7 months ago
Using Graphics Cards for Quantized FEM Computations
Graphics cards exercise increasingly more computing power and are highly optimized for high data transfer volumes. In contrast typical workstations perform badly when data exceeds...
Martin Rumpf, Robert Strzodka
UAI
2003
15 years 7 months ago
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
Radu Marinescu 0002, Kalev Kask, Rina Dechter
AMCS
2008
146views Mathematics» more  AMCS 2008»
15 years 6 months ago
Fault Detection and Isolation with Robust Principal Component Analysis
Principal component analysis (PCA) is a powerful fault detection and isolation method. However, the classical PCA which is based on the estimation of the sample mean and covariance...
Yvon Tharrault, Gilles Mourot, José Ragot, ...
CORR
2010
Springer
163views Education» more  CORR 2010»
15 years 6 months ago
Distributed Principal Component Analysis for Wireless Sensor Networks
Abstract: The Principal Component Analysis (PCA) is a data dimensionality reduction technique well-suited for processing data from sensor networks. It can be applied to tasks like ...
Yann-Aël Le Borgne, Sylvain Raybaud, Gianluca...