Sciweavers

1523 search results - page 99 / 305
» The Computational Complexity of Linear Optics
Sort
View
131
Voted
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
15 years 8 months ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin
POPL
2010
ACM
15 years 10 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak
132
Voted
AUTOMATICA
2007
103views more  AUTOMATICA 2007»
15 years 3 months ago
Lexicographic perturbation for multiparametric linear programming with applications to control
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs with a parameter in the cost, or equivalently the right-...
Colin Neil Jones, Eric C. Kerrigan, Jan M. Maciejo...
130
Voted
AVSS
2007
IEEE
15 years 7 months ago
A LQR spatiotemporal fusion technique for face profile collection in smart camera surveillance
In this paper, we propose a joint face orientation estimation in smart camera networks without having to localize the cameras in advance. The system is composed of in-node coarse ...
Chung-Ching Chang, Hamid K. Aghajan
135
Voted
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 10 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio