Sciweavers

1561 search results - page 235 / 313
» Probability Theory on IF Events
Sort
View
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
15 years 10 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
KDD
2002
ACM
109views Data Mining» more  KDD 2002»
15 years 10 months ago
Topics in 0--1 data
Large 0-1 datasets arise in various applications, such as market basket analysis and information retrieval. We concentrate on the study of topic models, aiming at results which in...
Ella Bingham, Heikki Mannila, Jouni K. Seppän...
RECOMB
2003
Springer
15 years 10 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
15 years 10 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
15 years 10 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos