Sciweavers

1091 search results - page 159 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 1 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
13 years 6 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo
IDA
2002
Springer
13 years 7 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
CVPR
2009
IEEE
15 years 3 months ago
Stochastic Gradient Kernel Density Mode-Seeking
As a well known fixed-point iteration algorithm for kernel density mode-seeking, Mean-Shift has attracted wide attention in pattern recognition field. To date, Mean-Shift algorit...
Xiaotong Yuan, Stan Z. Li
SAC
2008
ACM
13 years 7 months ago
Bayesian inference for a discretely observed stochastic kinetic model
The ability to infer parameters of gene regulatory networks is emerging as a key problem in systems biology. The biochemical data are intrinsically stochastic and tend to be observ...
Richard J. Boys, Darren J. Wilkinson, Thomas B. L....