Sciweavers

4277 search results - page 69 / 856
» On Multiple Linear Approximations
Sort
View
TIFS
2008
157views more  TIFS 2008»
14 years 10 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
JSC
2006
147views more  JSC 2006»
14 years 10 months ago
An algorithm to solve integer linear systems exactly using numerical methods
In this paper, we present a new algorithm for the exact solutions of linear systems with integer coefficients using numerical methods. It terminates with the correct answer in wel...
Zhendong Wan
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
15 years 2 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
CORR
2004
Springer
121views Education» more  CORR 2004»
14 years 9 months ago
Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners
We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, ...
Erik G. Boman, Bruce Hendrickson, Stephen A. Vavas...
CORR
2010
Springer
142views Education» more  CORR 2010»
14 years 10 months ago
Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov
Anna R. Karlin, Claire Mathieu, C. Thach Nguyen