Sciweavers

868 search results - page 8 / 174
» Finding Most Likely Solutions
Sort
View
CVPR
2009
IEEE
1517views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Linear Solution to Scale and Rotation Invariant Object Matching
Images of an object undergoing ego- or camera- motion often appear to be scaled, rotated, and deformed versions of each other. To detect and match such distorted patterns to a s...
Hao Jiang, Stella X. Yu
ICCV
2009
IEEE
15 years 18 days ago
Subspace matching: Unique solutions to point matching with geometric constraints
Finding correspondences between feature points is one of the most relevant problems in the whole set of visual tasks. In this paper we address the problem of matching a feature ...
Manuel Marques, Marko Stosic and Joao Costeira
EOR
2010
104views more  EOR 2010»
13 years 5 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
13 years 12 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
COMPGEOM
1990
ACM
13 years 11 months ago
Finding Compact Coordinate Representations for Polygons and Polyhedra
Practical solid modeling systems are plagued by numerical problems that arise from using oatingpoint arithmetic. For example, polyhedral solids are often represented by a combinat...
Victor Milenkovic, Lee R. Nackman