Sciweavers

845 search results - page 112 / 169
» Complexity Dimensions and Learnability
Sort
View
SIAMSC
2011
85views more  SIAMSC 2011»
14 years 2 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
13 years 11 months ago
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
IACR
2011
155views more  IACR 2011»
13 years 11 months ago
Terminating BKZ
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
CVPR
2003
IEEE
16 years 1 months ago
Learning Object Intrinsic Structure for Robust Visual Tracking
In this paper, a novel method to learn the intrinsic object structure for robust visual tracking is proposed. The basic assumption is that the parameterized object state lies on a...
Qiang Wang, Guangyou Xu, Haizhou Ai
CVPR
2005
IEEE
16 years 1 months ago
A High Resolution Grammatical Model for Face Representation and Sketching
In this paper we present a generative, high resolution face representation which extends the well-known active appearance model (AAM)[5, 6, 7] with two additional layers. (i) One ...
Zijian Xu, Hong Chen, Song Chun Zhu