Sciweavers

68 search results - page 11 / 14
» Fast Sparse Representation with Prototypes
Sort
View
160
Voted
TOG
2012
221views Communications» more  TOG 2012»
13 years 5 months ago
Gabor noise by example
Procedural noise is a fundamental tool in Computer Graphics. However, designing noise patterns is hard. In this paper, we present Gabor noise by example, a method to estimate the ...
Bruno Galerne, Ares Lagae, Sylvain Lefebvre, Georg...
NIPS
2004
15 years 3 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
IBPRIA
2009
Springer
15 years 7 months ago
Large Scale Online Learning of Image Similarity through Ranking
ent abstract presents OASIS, an Online Algorithm for Scalable Image Similarity learning that learns a bilinear similarity measure over sparse representations. OASIS is an online du...
Gal Chechik, Varun Sharma, Uri Shalit, Samy Bengio
VLSISP
2008
203views more  VLSISP 2008»
15 years 2 months ago
FPGA-based System for Real-Time Video Texture Analysis
This paper describes a novel system for real-time video texture analysis. The system utilizes hardware to extract 2nd -order statistical features from video frames. These features ...
Dimitrios E. Maroulis, Dimitrios K. Iakovidis, Dim...
145
Voted
CGO
2010
IEEE
15 years 9 months ago
Level by level: making flow- and context-sensitive pointer analysis scalable for millions of lines of code
We present a practical and scalable method for flow- and contextsensitive (FSCS) pointer analysis for C programs. Our method analyzes the pointers in a program level by level in ...
Hongtao Yu, Jingling Xue, Wei Huo, Xiaobing Feng 0...