The range of K-invariants for C*-algebras of infinite graphs
It is shown that for any pair (K 0 ,K 1 ) of countable abelian groups, with K 1 free abelian, and any element Ξ ∈ K 0 there exists a purely infinite and simple, stable C * -algebra C * (E)…
Jaworski Ontology-Based Knowledge Discovery from Documents in Natural Language
- Wojciech
- Computer Science
- 2009
A knowledge representation model which allows us to manipulate on concepts included in data by means of logic as well as answering semantic queries is developed, which combines the rough set theory with statistical learning theory obtaining simple, human understandable classes, whose quality will be guaranteed by the statistical assumptions.
An Universal Predictor Based on Pattern Matching Preliminary ResultsMarch 14 , 2000
- Philippe, Jacquety, Wojciech, Szpankowskiz, Izydor, ApostolINRIA
- Computer Science
- 2000
This preliminary version of an universal predictor based on pattern matching indicates that the algorithm can predict equally successfully the next k symbols as long as k = O(1).
Rough sets： the classical and extended views
The classic rough set model introduced by Pawlak is presented as a staging ground to the discussion of two varieties of the probabilistic approach, i.e. of the variable precision and Bayesian rough set models.
Evaluating TreeAge ’ s Pseudo Random Number Generator and Implementation of Statistical Distributions
- B. Klingenberg, Wojciech
- Mathematics
- 2014
To establish if the uniform number generator implemented in the TreeAge software delivers the expected outcome we investigated the probabilistic and statistical properties of pseudo uniform random…
ANALYTICAL DEPOISSONIZATION AND ITS APPLICATIONS TOCOMBINATORICS AND ANALYSIS OF ALGORITHMS
In combinatorics and analysis of algorithms often a Poisson version of a problem (called Poisson model or poissonization) is easier to solve than the original one, which is known as the Bernoulli…
Limit Laws for Heights in Generalized Tries andPATRICIA
- TriesApril, C. Knessl, Wojciech, SzpankowskiyDept
- Mathematics
- 1999
We consider digital trees such as (generalized) tries and PATRICIA tries, built from n random strings generated by an unbiased memoryless source (i.e., all symbols are equally likely). We study limit…