Sciweavers

583 search results - page 90 / 117
» On small blocking sets and their linearity
Sort
View
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
14 years 9 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
LCPC
2000
Springer
14 years 6 days ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
CVPR
2003
IEEE
14 years 10 months ago
Learning Appearance and Transparency Manifolds of Occluded Objects in Layers
By mapping a set of input images to points in a lowdimensional manifold or subspace, it is possible to efficiently account for a small number of degrees of freedom. For example, i...
Brendan J. Frey, Nebojsa Jojic, Anitha Kannan
CVPR
2004
IEEE
14 years 10 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
CVPR
2004
IEEE
14 years 10 months ago
Random Sampling LDA for Face Recognition
Linear Discriminant Analysis (LDA) is a popular feature extraction technique for face recognition. However, It often suffers from the small sample size problem when dealing with t...
Xiaogang Wang, Xiaoou Tang