1523 search results - page 121 / 305 » The Computational Complexity of Linear Optics |
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
— This paper studies the problem of stability analysis for neural networks (NNs) with a time-varying delay. The activation functions are assumed to be neither monotonic, nor diff...
IJCNN
2007
IEEE
14 years 4 months ago
2007
IEEE
— This work addresses the problem of selecting a subset of basis functions for a model linear in the parameters for regression tasks. Basis functions from a set of candidates are...
COR
2008
13 years 9 months ago
2008
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
SODA
2010
ACM
13 years 8 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
CGF
2011
13 years 1 months ago
2011
We present a novel method to estimate an approximation of the reflectance characteristics of optically thick, homogeneous translucent materials using only a single photograph as ...