Sciweavers

4843 search results - page 313 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
ICA
2010
Springer
15 years 5 months ago
Recovering Spikes from Noisy Neuronal Calcium Signals via Structured Sparse Approximation
Two-photon calcium imaging is an emerging experimental technique that enables the study of information processing within neural circuits in vivo. While the spatial resolution of th...
Eva L. Dyer, Marco F. Duarte, Don H. Johnson, Rich...
SIAMMAX
2010
224views more  SIAMMAX 2010»
14 years 10 months ago
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
Jianlin Xia, Ming Gu
WWW
2009
ACM
16 years 4 months ago
Answering approximate queries over autonomous web databases
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
Xiangfu Meng, Z. M. Ma, Li Yan
EDBT
2006
ACM
190views Database» more  EDBT 2006»
16 years 4 months ago
Fast Approximate Wavelet Tracking on Streams
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
Graham Cormode, Minos N. Garofalakis, Dimitris Sac...
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 11 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...