Sciweavers

1083 search results - page 16 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
PAMI
2010
164views more  PAMI 2010»
13 years 6 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas
ESORICS
2009
Springer
14 years 8 months ago
Data Structures with Unpredictable Timing
Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...
Darrell Bethea, Michael K. Reiter
JMLR
2008
117views more  JMLR 2008»
13 years 7 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac
ICIP
2007
IEEE
14 years 9 months ago
Common Spatial Pattern Discovery by Efficient Candidate Pruning
Automatically discovering common visual patterns in images is very challenging due to the uncertainties in the visual appearances of such spatial patterns and the enormous computa...
Junsong Yuan, Zhu Li, Yun Fu, Ying Wu, Thomas S. H...
RECOMB
2009
Springer
14 years 8 months ago
Haplotype Inference in Complex Pedigrees
Abstract. Despite the desirable information contained in complex pedigree datasets, analysis methods struggle to efficiently process these datasets. The attractiveness of pedigree ...
Bonnie Kirkpatrick, Javier Rosa, Eran Halperin, Ri...