165 search results - page 32 / 33 » Computing a Nearest Correlation Matrix with Factor Structure |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The main aim of the work presented here is to contribute to computer science advances in the multimodal usability area, in-as-much as it addresses one of the major issues relating...
ECCV
2006
Springer
13 years 11 months ago
2006
Springer
The recovery of 3D shape and camera motion for non-rigid scenes from single-camera video footage is a very important problem in computer vision. The low-rank shape model consists ...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
ICDE
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...