Sciweavers

129 search results - page 15 / 26
» Matrix Decomposition Problem Is Complete for the Average Cas...
Sort
View
IVC
2007
131views more  IVC 2007»
13 years 8 months ago
Multi-view correspondence by enforcement of rigidity constraints
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
Ricardo Oliveira, João Xavier, João ...
SIAMMAX
2010
116views more  SIAMMAX 2010»
13 years 3 months ago
Structured Total Maximum Likelihood: An Alternative to Structured Total Least Squares
Abstract. Linear inverse problems with uncertain measurement matrices appear in many different applications. One of the standard techniques for solving such problems is the total l...
Amir Beck, Yonina C. Eldar
CVPR
1996
IEEE
14 years 10 months ago
Determining Correspondences and Rigid Motion of 3-D Point Sets with Missing Data
This paper addresses the general 3-D rigid motion problem, where the point correspondences and the motion parameters between two sets of 3-D points are to be recovered. The existe...
Xiaoguang Wang, Yong-Qing Cheng, Robert T. Collins...
EUROPAR
2010
Springer
13 years 9 months ago
Efficient Address Mapping of Shared Cache for On-Chip Many-Core Architecture
Abstract. Performance of the on-chip cache is critical for processor. The multithread program model usually employed by on-chip many-core architectures may have effects on cache ac...
Fenglong Song, Dongrui Fan, Zhiyong Liu, Junchao Z...
AMW
2009
13 years 6 months ago
Schema Design for Uncertain Databases
We address schema design in uncertain databases. Since uncertain data is relational in nature, decomposition becomes a key issue in design. Decomposition relies on dependency theo...
Anish Das Sarma, Jeffrey D. Ullman, Jennifer Widom