1523 search results - page 98 / 305 » The Computational Complexity of Linear Optics |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
CIE
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...