Sciweavers

103 search results - page 16 / 21
» Pattern avoidance in binary trees
Sort
View
ICB
2007
Springer
683views Biometrics» more  ICB 2007»
14 years 4 months ago
Face Detection Based on Multi-Block LBP Representation
Effective and real-time face detection has been made possible by using the method of rectangle Haar-like features with AdaBoost learning since Viola and Jones’ work [12]. In this...
Lun Zhang, Rufeng Chu, Shiming Xiang, ShengCai Lia...
ICDM
2002
IEEE
156views Data Mining» more  ICDM 2002»
14 years 2 months ago
Association Analysis with One Scan of Databases
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
Hao Huang, Xindong Wu, Richard Relue
NIPS
2000
13 years 11 months ago
Dendritic Compartmentalization Could Underlie Competition and Attentional Biasing of Simultaneous Visual Stimuli
Neurons in area V4 have relatively large receptive fields (RFs), so multiple visual features are simultaneously "seen" by these cells. Recordings from single V4 neurons ...
Kevin A. Archie, Bartlett W. Mel
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 10 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
IACR
2011
127views more  IACR 2011»
12 years 9 months ago
Oblivious RAM with O((log N)^3) Worst-Case Cost
Oblivious RAM (O-RAM) is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. This paper proposes...
Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Ming...