Sciweavers

762 search results - page 119 / 153
» Finding Facilities Fast
Sort
View
SAC
2010
ACM
13 years 10 months ago
FANGS: high speed sequence mapping for next generation sequencers
Next Generation Sequencing machines are generating millions of short DNA sequences (reads) everyday. There is a need for efficient algorithms to map these sequences to the referen...
Sanchit Misra, Ramanathan Narayanan, Simon Lin, Al...
AMCS
2008
146views Mathematics» more  AMCS 2008»
13 years 10 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, ...
CCE
2008
13 years 10 months ago
Bidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...
Yi Cao, Vinay Kariwala
CG
2008
Springer
13 years 10 months ago
Tight and efficient surface bounds in meshless animation
This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated ...
Denis Steinemann, Miguel A. Otaduy, Markus H. Gros...
DC
2010
13 years 10 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie