Sciweavers

5115 search results - page 617 / 1023
» On Randomized Lanczos Algorithms
Sort
View
PAMI
2010
160views more  PAMI 2010»
15 years 5 months ago
Photometric Stereo via Expectation Maximization
—This paper presents a robust and automatic approach to photometric stereo, where the two main components, namely surface normals and visible surfaces, are respectively optimized...
Tai-Pang Wu, Chi-Keung Tang
SIAMSC
2010
141views more  SIAMSC 2010»
15 years 5 months ago
Blendenpik: Supercharging LAPACK's Least-Squares Solver
Abstract. Several innovative random-sampling and random-mixing techniques for solving problems in linear algebra have been proposed in the last decade, but they have not yet made a...
Haim Avron, Petar Maymounkov, Sivan Toledo
BMVC
2010
15 years 4 months ago
Incremental Model Selection for Detection and Tracking of Planar Surfaces
Man-made environments are abundant with planar surfaces which have attractive properties and are a prerequisite for a variety of vision tasks. This paper presents an incremental m...
Johann Prankl, Michael Zillich, Bastian Leibe, Mar...
151
Voted
CG
2010
Springer
15 years 4 months ago
A Principled Method for Exploiting Opening Books
We used in the past a lot of computational power and human expertise for having a very big dataset of good 9x9 Go games, in order to build an opening book. We improved a lot the al...
Romaric Gaudel, Jean-Baptiste Hoock, Julien Perez,...
IMC
2010
ACM
15 years 4 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim