732 search results - page 66 / 147 » corr 2011 |
178
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We prove a strong Symmetry of Information relation for random strings (in the sense of Kolmogorov complexity) and establish tight bounds on the amount on nonuniformity that is nec...
170
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
186
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
180
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
This paper presents an overview of S2AEA (v2) (Strategic Alignment Assessment based on Enterprise Architecture (version2)), a platform for modelling enterprise architecture and fo...
142
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Information Retrieval systems can be improved by exploiting context information such as user and document features. This article presents a model based on overlapping probabilistic...