344 search results - page 15 / 69 » Some Theorems We Should Prove |
COMBINATORICS
2002
14 years 11 months ago
2002
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, ...
STACS
2009
Springer
15 years 6 months ago
2009
Springer
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...
101
click to vote
ICDM
2003
IEEE
2003
IEEE
Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research
15 years 5 months ago
Given the recent explosion of interest in streaming data and online algorithms, clustering of time series subsequences, extracted via a sliding window, has received much attention...
AML
2000
14 years 11 months ago
2000
We study a local version of the order property in several frameworks, with an emphasis on frameworks where the compactness theorem fails: (1) Inside a fixed model, (2) for classes ...
NN
2006
Springer
14 years 11 months ago
2006
Springer
- Since the discovery of the SOMs by T. Kohonen, many results have been found in order to get a better description of their behaviour. Most of them are very convincing but from a m...