COMPLEX
2009
Springer
14 years 3 months ago
2009
Springer
The most common approach to community identification of directed networks has been to ignore edge directions and apply methods developed for undirected networks. Recently, Leicht a...
COMPLEX
2009
Springer
14 years 3 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
COMPLEX
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The aim of a transportation system is to enable the movement of goods or persons between any two locations with the highest possible efficiency. This simple principle ins...
COMPLEX
2009
Springer
14 years 3 months ago
2009
Springer
The causal states of computational mechanics define the minimal sufficient (prescient) memory for a given stationary stochastic process. They induce the -machine which is a hidden...
COMPLEX
2009
Springer
14 years 3 months ago
2009
Springer
Online Social Networks (OSN) are experiencing an explosive growth rate and are becoming an increasingly important part of people's lives. There is an increasing desire to aid ...
DIS
2007
Springer
14 years 3 months ago
2007
Springer
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
DIS
2007
Springer
14 years 3 months ago
2007
Springer
DIS
2007
Springer
14 years 3 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
CSR
2007
Springer
14 years 3 months ago
2007
Springer
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...
CSR
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...