1523 search results - page 249 / 305 » The Computational Complexity of Linear Optics |
114
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
144
Voted
SI3D
2005
ACM
15 years 9 months ago
2005
ACM
We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We ...
161
Voted
STACS
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
144
click to vote
MOBICOM
2012
ACM
13 years 6 months ago
2012
ACM
GPS is one of the most widely used wireless systems. A GPS receiver has to lock on the satellite signals to calculate its position. The process of locking on the satellites is qui...
122
Voted
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can ...