2714 search results - page 229 / 543 » Approximation Schemes for Scheduling |
183
click to vote
TIFS
2008
15 years 4 months ago
2008
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...
149
Voted
SIAMMAX
2010
14 years 11 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
173
Voted
SCIA
2009
Springer
15 years 11 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
131
click to vote
SIGCOMM
1999
ACM
15 years 9 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
145
Voted
MST
2007
15 years 4 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...