Sciweavers

3006 search results - page 294 / 602
» Dimensionality reduction and generalization
Sort
View
CC
2010
Springer
112views System Software» more  CC 2010»
15 years 1 months ago
Random Cnf's are Hard for the Polynomial Calculus
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
Eli Ben-Sasson, Russell Impagliazzo
DLOG
2011
14 years 10 months ago
Bidirectional Reachability-Based Modules
We introduce an algorithm for MinA extraction in EL based on bidirectional reachability. We obtain a significant reduction in the size of modules extracted at almost no additional...
Riku Nortje, Arina Britz, Thomas Andreas Meyer
193
Voted
CVPR
2009
IEEE
17 years 1 months ago
SIFT-Rank: Ordinal Description for Invariant Feature Correspondence
This paper investigates ordinal image description for invariant feature correspondence. Ordinal description is a meta-technique which considers image measurements in terms of th...
Matthew Toews, William M. Wells III
ICIP
2007
IEEE
16 years 8 months ago
Direct Motion Estimation in the Radon Transform Domain using Match-Profile Backprojections
Integral projections have been proposed as an efficient method to reduce the dimensionality of the search space in motion estimation (ME) algorithms. A number of papers describe m...
Chris Bartels, Gerard de Haan
181
Voted
MICCAI
2008
Springer
16 years 8 months ago
Efficient Computation of PDF-Based Characteristics from Diffusion MR Signal
Abstract. We present a general method for the computation of PDFbased characteristics of the tissue micro-architecture in MR imaging. The approach relies on the approximation of th...
David Tschumperlé, Haz-Edine Assemlal, Luc ...