Sciweavers

1019 search results - page 7 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
PC
2007
161views Management» more  PC 2007»
13 years 7 months ago
High performance combinatorial algorithm design on the Cell Broadband Engine processor
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
David A. Bader, Virat Agarwal, Kamesh Madduri, Seu...
ICA
2007
Springer
14 years 1 months ago
Optimization on the Orthogonal Group for Independent Component Analysis
Abstract. This paper derives a new algorithm that performs independent component analysis (ICA) by optimizing the contrast function of the RADICAL algorithm. The core idea of the p...
Michel Journée, Pierre-Antoine Absil, Rodol...
ICML
2001
IEEE
14 years 8 months ago
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
We present conditional random fields, a framework for building probabilistic models to segment and label sequence data. Conditional random fields offer several advantages over hid...
John D. Lafferty, Andrew McCallum, Fernando C. N. ...
MICCAI
2009
Springer
14 years 8 months ago
A Conditional Random Field Approach for Coupling Local Registration with Robust Tissue and Structure Segmentation
Abstract. We consider a general modelling strategy to handle in a unified way a number of tasks essential to MR brain scan analysis. Our approach is based on the explicit definitio...
Benoit Scherrer, Florence Forbes, Michel Dojat
ESANN
2004
13 years 8 months ago
Robust overcomplete matrix recovery for sparse sources using a generalized Hough transform
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
Fabian J. Theis, Pando G. Georgiev, Andrzej Cichoc...