Sciweavers

1689 search results - page 148 / 338
» Proximate point searching
Sort
View
IVC
2000
113views more  IVC 2000»
15 years 5 months ago
Matching disparate views of planar surfaces using projective invariants
Feature matching is a prerequisite to a wide variety of vision tasks. This paper presents a method that addresses the problem of matching disparate views of coplanar points and li...
Manolis I. A. Lourakis, Spyros T. Halkidis, Stelio...
CDC
2008
IEEE
161views Control Systems» more  CDC 2008»
15 years 7 months ago
A fast algorithm to compute the controllability, decentralized fixed-mode, and minimum-phase radius of LTI systems
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
Simon Lam, Edward J. Davison
CSC
2006
15 years 7 months ago
Irregular Solutions of an Ill-Posed Problem
Abstract: Tikhonov regularization is a popular and effective method for the approximate solution of illposed problems, including Fredholm equations of the first kind. The Tikhonov ...
Peter Linz, Richard Wang
CCCG
2001
15 years 7 months ago
Translational polygon covering using intersection graphs
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
Karen Daniels, Rajasekhar Inkulu
178
Voted
EOR
2010
140views more  EOR 2010»
15 years 3 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz