Sciweavers

1077 search results - page 78 / 216
» Approximate reduction of dynamic systems
Sort
View
SIAMNUM
2010
96views more  SIAMNUM 2010»
14 years 10 months ago
A Stochastic Algorithm for Parametric Sensitivity in Smoluchowski's Coagulation Equation
Abstract. In this article a stochastic particle system approximation to the parametric sensitivity in the Smoluchowski coagulation equation is introduced. The parametric sensitivit...
Ismaël F. Bailleul, Peter L. W. Man, Markus K...
VLDB
2000
ACM
155views Database» more  VLDB 2000»
15 years 7 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
INFOCOM
2006
IEEE
15 years 10 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 8 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
ICFP
2006
ACM
16 years 4 months ago
The missing link: dynamic components for ML
Despite its powerful module system, ML has not yet evolved for the modern world of dynamic and open modular programming, to which more primitive languages have adapted better so f...
Andreas Rossberg