Sciweavers

2342 search results - page 114 / 469
» Sublinear geometric algorithms
Sort
View
CVPR
2005
IEEE
16 years 2 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...
DATE
2007
IEEE
98views Hardware» more  DATE 2007»
15 years 7 months ago
Simulation-based reusable posynomial models for MOS transistor parameters
We present an algorithm to automatically design posynomial models for parameters of the MOS transistors using simulation data. These models improve the accuracy of the Geometric P...
Varun Aggarwal, Una-May O'Reilly
KIVS
2005
Springer
15 years 6 months ago
A Case for Lightweight SuperPeer Topologies
: The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware cla...
Michael Kleis, Eng Keong Lua, Xiaoming Zhou
70
Voted
CVPR
2006
IEEE
16 years 2 months ago
Affine Invariance Revisited
This paper proposes a Riemannian geometric framework to compute averages and distributions of point configurations so that different configurations up to affine transformations ar...
Evgeni Begelfor, Michael Werman
95
Voted
ECCV
1992
Springer
15 years 4 months ago
Critical Sets for 3D Reconstruction Using Lines
This paper describes the geometrical limitations of algorithms for 3D reconstruction which use corresponding line tokens. In addition to announcing a description of the general cri...
Thomas Buchanan