Sciweavers

6693 search results - page 1219 / 1339
» On an anytime algorithm for control
Sort
View
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 2 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
TASLP
2010
107views more  TASLP 2010»
13 years 2 months ago
A Robust Method to Extract Talker Azimuth Orientation Using a Large-Aperture Microphone Array
Knowing the orientation of a talker in the focal area of a large-aperture microphone array enables the development of better beamforming algorithms (to obtain higher-quality speech...
Avram Levi, Harvey F. Silverman
BMCBI
2011
13 years 2 months ago
SNPPicker: High quality tag SNP selection across multiple populations
Background: Linkage Disequilibrium (LD) bin-tagging algorithms identify a reduced set of tag SNPs that can capture the genetic variation in a population without genotyping every s...
Hugues Sicotte, David N. Rider, Gregory A. Poland,...
MIA
2011
170views more  MIA 2011»
13 years 2 months ago
Robust statistical shape models for MRI bone segmentation in presence of small field of view
Accurate bone modeling from medical images is essential in the diagnosis and treatment of patients because it supports the detection of abnormal bone morphology, which is often re...
Jérôme Schmid, Jinman Kim, Nadia Magn...
ICDCN
2011
Springer
12 years 11 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
« Prev « First page 1219 / 1339 Last » Next »