Sciweavers

424 search results - page 20 / 85
» Boosted sampling: approximation algorithms for stochastic op...
Sort
View
DMSN
2004
ACM
14 years 28 days ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
14 years 7 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
13 years 2 months ago
Hybrid moment computation algorithm for biochemical reaction networks
Moment computation is essential to the analysis of stochastic kinetic models of biochemical reaction networks. It is often the case that the moment evolution, usually the first and...
Yun-Bo Zhao, Jongrae Kim, João Pedro Hespan...
ICRA
1995
IEEE
188views Robotics» more  ICRA 1995»
13 years 11 months ago
Fast Approximation of Range Images by Triangular Meshes Generated through Adaptive Randomized Sampling
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
Miguel Angel García
WSC
2007
13 years 9 months ago
New greedy myopic and existing asymptotic sequential selection procedures: preliminary empirical results
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
Stephen E. Chick, Jürgen Branke, Christian Sc...