Sciweavers

1055 search results - page 65 / 211
» Enumerations in computable structure theory
Sort
View
KDD
2009
ACM
364views Data Mining» more  KDD 2009»
15 years 10 months ago
Causality quantification and its applications: structuring and modeling of multivariate time series
Time series prediction is an important issue in a wide range of areas. There are various real world processes whose states vary continuously, and those processes may have influenc...
Takashi Shibuya, Tatsuya Harada, Yasuo Kuniyoshi
CIKM
2005
Springer
15 years 3 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
APAL
2010
85views more  APAL 2010»
14 years 10 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
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 ...
George Barmpalias
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
15 years 10 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
CSFW
2010
IEEE
15 years 1 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko