Sciweavers

4850 search results - page 316 / 970
» Approximate Data Structures with Applications
Sort
View
BMCBI
2008
130views more  BMCBI 2008»
15 years 6 months ago
An enhanced partial order curve comparison algorithm and its application to analyzing protein folding trajectories
Background: Understanding how proteins fold is essential to our quest in discovering how life works at the molecular level. Current computation power enables researchers to produc...
Hong Sun, Hakan Ferhatosmanoglu, Motonori Ota, Yus...
ICASSP
2011
IEEE
14 years 10 months ago
Scalable robust hypothesis tests using graphical models
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
Divyanshu Vats, Vishal Monga, Umamahesh Srinivas, ...
CSDA
2006
84views more  CSDA 2006»
15 years 6 months ago
Performing hypothesis tests on the shape of functional data
We explore different approaches for performing hypothesis tests on the shape of a mean function by developing general methodologies both, for the often assumed, i.i.d. error struc...
Gareth M. James, Ashish Sood
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
15 years 8 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
ISNN
2010
Springer
15 years 11 months ago
Applications of Second Order Blind Identification to High-Density EEG-Based Brain Imaging: A Review
In the context of relating specific brain functions to specific brain structures, second-order blind identification (SOBI) is one of the blind source separation algorithms that hav...
Akaysha Tang