Sciweavers

94 search results - page 1 / 19
» A note on linear function approximation using random project...
Sort
View
SCL
2008
109views more  SCL 2008»
13 years 4 months ago
A note on linear function approximation using random projections
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
Kishor Barman, Vivek S. Borkar
JMM2
2007
96views more  JMM2 2007»
13 years 4 months ago
A Framework for Linear Transform Approximation Using Orthogonal Basis Projection
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
Yinpeng Chen, Hari Sundaram
CORR
2008
Springer
77views Education» more  CORR 2008»
13 years 4 months ago
Optimal hash functions for approximate closest pairs on the n-cube
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...
Daniel M. Gordon, Victor Miller, Peter Ostapenko
JACIII
2007
99views more  JACIII 2007»
13 years 4 months ago
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
Guoli Ding, Robert F. Lax, Peter P. Chen, Jianhua ...
ANOR
2006
64views more  ANOR 2006»
13 years 4 months ago
A note on asymptotic formulae for one-dimensional network flow problems
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
Carlos F. Daganzo, Karen R. Smilowitz