Sciweavers

874 search results - page 121 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
CBMS
2005
IEEE
15 years 3 months ago
Approximations to Magic: Finding Unusual Medical Time Series
In this work we introduce the new problem of finding time series discords. Time series discords are subsequences of longer time series that are maximally different to all the rest...
Jessica Lin, Eamonn J. Keogh, Ada Wai-Chee Fu, Hel...
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
15 years 6 months ago
Highly Accurate Fast Methods for Extraction and Sparsification of Substrate Coupling Based on Low-Rank Approximation
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
Joe Kanapka, Jacob White
DICTA
2008
14 years 11 months ago
Image Reconstruction from Contrast Information
An iterative algorithm for the reconstruction of natural images given only their contrast map is presented. The solution is neuro-physiologically inspired, where the retinal cells...
Asim A. Khwaja, Roland Goecke
BMCBI
2007
197views more  BMCBI 2007»
14 years 10 months ago
Boolean networks using the chi-square test for inferring large-scale gene regulatory networks
Background: Boolean network (BN) modeling is a commonly used method for constructing gene regulatory networks from time series microarray data. However, its major drawback is that...
Haseong Kim, Jae K. Lee, Taesung Park
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
13 years 10 days ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park