Sciweavers

1093 search results - page 63 / 219
» Fast Abstracts
Sort
View
119
Voted
DAWAK
2010
Springer
15 years 6 days ago
Mining Non-redundant Information-Theoretic Dependencies between Itemsets
Abstract. We present an information-theoretic framework for mining dependencies between itemsets in binary data. The problem of closure-based redundancy in this context is theoreti...
Michael Mampaey
105
Voted
TIFS
2010
171views more  TIFS 2010»
14 years 9 months ago
A method for automatic identification of signatures of steganography software
Abstract--A fully automated, blind, media-type agnostic approach to steganalysis is presented here. Steganography may sometimes be exposed by detecting automatically characterized ...
Graeme Bell, Yeuan-Kuen Lee
117
Voted
FAST
2010
15 years 4 months ago
quFiles: The Right File at the Right Time
is a unifying abstraction that simplifies data management by encapsulating different physical representations of the same logical data. Similar to a quBit (quantum bit), the parti...
Kaushik Veeraraghavan, Jason Flinn, Edmund B. Nigh...
128
Voted
RECOMB
2006
Springer
16 years 2 months ago
Maximal Accurate Forests from Distance Matrices
Abstract. We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarante...
Constantinos Daskalakis, Cameron Hill, Alexander J...
DICTA
2003
15 years 3 months ago
Diamond, Hexagon, and General Polygonal Shaped Window Smoothing
Abstract. This paper presents fast recursive or moving windows algorithms for calculating local means in a diamond, hexagon and general polygonal shaped windows of an image. The al...
Changming Sun