Sciweavers

3652 search results - page 330 / 731
» A study of query length
Sort
View
131
Voted
SAC
2008
ACM
15 years 3 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee
144
Voted
ICITS
2009
15 years 1 months ago
Survey: Leakage Resilience and the Bounded Retrieval Model
Abstract. This survey paper studies recent advances in the field of LeakageResilient Cryptography. This booming area is concerned with the design of cryptographic primitives resist...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
124
Voted
CORR
2010
Springer
108views Education» more  CORR 2010»
14 years 10 months ago
Finding Cycles and Trees in Sublinear Time
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
TCBB
2010
98views more  TCBB 2010»
14 years 10 months ago
VARUN: Discovering Extensible Motifs under Saturation Constraints
Abstract-The discovery of motifs in biosequences is frequently torn between the rigidity of the model on the one hand and the abundance of candidates on the other. In particular, m...
Alberto Apostolico, Matteo Comin, Laxmi Parida
143
Voted
TCS
2010
14 years 10 months ago
Information measures for infinite sequences
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
Luis Filipe Coelho Antunes, Andre Souto