Sciweavers

5414 search results - page 57 / 1083
» Data representation synthesis
Sort
View
LICS
1997
IEEE
15 years 3 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
ICA
2007
Springer
15 years 1 months ago
Bayesian Estimation of Overcomplete Independent Feature Subspaces for Natural Images
In this paper, we propose a Bayesian estimation approach to extend independent subspace analysis (ISA) for an overcomplete representation without imposing the orthogonal constraint...
Libo Ma, Liqing Zhang
ICASSP
2010
IEEE
15 years 17 hour ago
A comparative study of tonal acoustic features for a symbolic level music-to-score alignment
In this paper we review the acoustic features used for music-to-score alignment and study their influence on the performance in a challenging alignment task, where the audio data...
Cyril Joder, Slim Essid, Gaël Richard
VC
2008
132views more  VC 2008»
14 years 11 months ago
Caustic spot light for rendering caustics
It is difficult to render caustic patterns at interactive frame rates. This paper introduces new rendering techniques that relax current constraints, allowing scenes with moving, n...
Xinguo Liu, Zhao Dong, Hujun Bao, Qunsheng Peng
CVPR
2012
IEEE
13 years 2 months ago
Hierarchical face parsing via deep learning
This paper investigates how to parse (segment) facial components from face images which may be partially occluded. We propose a novel face parser, which recasts segmentation of fa...
Ping Luo, Xiaogang Wang, Xiaoou Tang