296 search results - page 27 / 60 » Approximate Discovery of Random Graphs |
TMC
2011
13 years 2 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
SDM
2010
SIAM
13 years 6 months ago
2010
SIAM
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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
EUSFLAT
2009
13 years 5 months ago
2009
Besides the problem of searching for effective methods for extracting knowledge from large databases (KDD) there are some additional problems with handling ecological data, namely ...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...