Sciweavers

815 search results - page 61 / 163
» Approximate Entropy Reducts
Sort
View
CVPR
2007
IEEE
16 years 1 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 5 days ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
ICCAD
2007
IEEE
173views Hardware» more  ICCAD 2007»
15 years 8 months ago
Bounding L2 gain system error generated by approximations of the nonlinear vector field
Abstract— Typical nonlinear model order reduction approaches need to address two issues: reducing the order of the model, and approximating the vector field. In this paper we fo...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
15 years 6 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
15 years 1 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...