Sciweavers

6274 search results - page 150 / 1255
» From query complexity to computational complexity
Sort
View
PODS
2000
ACM
146views Database» more  PODS 2000»
15 years 8 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
BIBM
2010
IEEE
139views Bioinformatics» more  BIBM 2010»
15 years 1 months ago
Scalable, updatable predictive models for sequence data
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
Neeraj Koul, Ngot Bui, Vasant Honavar
HICSS
2003
IEEE
98views Biometrics» more  HICSS 2003»
15 years 9 months ago
On the Limits of Bottom-Up Computer Simulation: Towards a Nonlinear Modeling Culture
1 In the complexity and simulation communities there is growing support for the use of bottom-up computer-based simulation in the analysis of complex systems. The presumption is th...
Kurt A. Richardson
COGSCI
2010
160views more  COGSCI 2010»
15 years 4 months ago
Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...
Jakub Szymanik, Marcin Zajenkowski
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
15 years 8 months ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer