Sciweavers

1578 search results - page 60 / 316
» Algorithmic randomness of continuous functions
Sort
View
CP
2004
Springer
15 years 3 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore
CVPR
2010
IEEE
1639views Computer Vision» more  CVPR 2010»
15 years 5 months ago
Multi-Target Tracking of Time-varying Spatial Patterns
Time-varying spatial patterns are common, but few computational tools exist for discovering and tracking multiple, sometimes overlapping, spatial structures of targets. We propose...
Jingchen Liu, Yanxi Liu
KDD
2004
ACM
157views Data Mining» more  KDD 2004»
15 years 3 months ago
On detecting space-time clusters
Detection of space-time clusters is an important function in various domains (e.g., epidemiology and public health). The pioneering work on the spatial scan statistic is often use...
Vijay S. Iyengar
KES
2007
Springer
15 years 3 months ago
Random Germs and Stochastic Watershed for Unsupervised Multispectral Image Segmentation
This paper extends the use of stochastic watershed, recently introduced by Angulo and Jeulin [1], to unsupervised segmentation of multispectral images. Several probability density ...
Guillaume Noyel, Jesús Angulo, Dominique Je...
ICMLA
2004
14 years 11 months ago
RAIN: data clustering using randomized interactions between data points
Abstract-- This paper introduces a generalization of the Gravitational Clustering Algorithm proposed by Gomez et all in [1]. First, it is extended in such a way that not only the G...
Jonatan Gómez, Olfa Nasraoui, Elizabeth Leo...