9871 search results - page 256 / 1975 » On the Structure of Low Sets |
128
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...
204
Voted
JMLR
2010
15 years 1 months ago
2010
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
208
click to vote
DM
2011
14 years 10 months ago
2011
A relational first order structure is homogeneous if it is countable (possibly finite) and every isomorphism between finite substructures extends to an automorphism. This artic...
181
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Discovering causal relations among observed variables in a given data set is a main topic in studies of statistics and artificial intelligence. Recently, some techniques to disco...
279
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...