Sciweavers

4850 search results - page 128 / 970
» Approximate Data Structures with Applications
Sort
View
SIAMSC
2011
219views more  SIAMSC 2011»
14 years 5 months ago
Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
H. P. Flath, Lucas C. Wilcox, Volkan Akcelik, Judi...
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
14 years 11 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
ICDM
2006
IEEE
152views Data Mining» more  ICDM 2006»
15 years 4 months ago
Application of Graph-based Data Mining to Metabolic Pathways
We present a method for finding biologically meaningful patterns on metabolic pathways using the SUBDUE graph-based relational learning system. A huge amount of biological data t...
Chang Hun You, Lawrence B. Holder, Diane J. Cook
BIOINFORMATICS
2011
14 years 1 months ago
libfbi: a C++ implementation for fast box intersection and application to sparse mass spectrometry data
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....
SEBD
2003
154views Database» more  SEBD 2003»
14 years 11 months ago
Management of User Preferences in Data Intensive Applications
Abstract. The management of user preferences is becoming a fundamental ingredient of modern Web-based data-intensive applications, in which information filtering is crucial to red...
Riccardo Torlone, Paolo Ciaccia