Sciweavers

344 search results - page 15 / 69
» Some Theorems We Should Prove
Sort
View
COMBINATORICS
2002
70views more  COMBINATORICS 2002»
13 years 7 months ago
Set-Systems with Restricted Multiple Intersections
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, ...
Vince Grolmusz
STACS
2009
Springer
14 years 2 months ago
Randomness on Computable Probability Spaces - A Dynamical Point of View
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, ...
Péter Gács, Mathieu Hoyrup, Cristoba...
ICDM
2003
IEEE
240views Data Mining» more  ICDM 2003»
14 years 19 days ago
Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research
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...
Eamonn J. Keogh, Jessica Lin, Wagner Truppel
AML
2000
101views more  AML 2000»
13 years 7 months ago
Local order property in nonelementary classes
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 ...
Rami P. Grossberg, Olivier Lessmann
NN
2006
Springer
13 years 7 months ago
SOM's mathematics
- 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...
Jean-Claude Fort