Sciweavers

2600 search results - page 149 / 520
» Clustering with or without the Approximation
Sort
View
VLDB
2000
ACM
155views Database» more  VLDB 2000»
15 years 10 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
BMCBI
2010
185views more  BMCBI 2010»
15 years 6 months ago
ABCtoolbox: a versatile toolkit for approximate Bayesian computations
Background: The estimation of demographic parameters from genetic data often requires the computation of likelihoods. However, the likelihood function is computationally intractab...
Daniel Wegmann, Christoph Leuenberger, Samuel Neue...
JCC
2002
127views more  JCC 2002»
15 years 6 months ago
Effective Born radii in the generalized Born approximation: The importance of being perfect
: Generalized Born (GB) models provide, for many applications, an accurate and computationally facile estimate of the electrostatic contribution to aqueous solvation. The GB models...
Alexey Onufriev, David A. Case, Donald Bashford
SADM
2008
178views more  SADM 2008»
15 years 6 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 6 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...