22 search results - page 3 / 5 » Topological Structures of Rough Sets Induced by Equivalence ... |
APAL
2010
14 years 12 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
102
click to vote
BIRTHDAY
2000
Springer
15 years 4 months ago
2000
Springer
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
102
click to vote
PARA
1995
Springer
15 years 3 months ago
1995
Springer
This paper describes a proposal for a set of Parallel Basic Linear Algebra Subprograms PBLAS . The PBLAS are targeted at distributed vector-vector, matrix-vector and matrixmatrix...
125
click to vote
ACL
2011
14 years 3 months ago
2011
We propose a non-parametric Bayesian model for unsupervised semantic parsing. Following Poon and Domingos (2009), we consider a semantic parsing setting where the goal is to (1) d...
120
click to vote
CONCUR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g., automaton and Turing machine...