Sciweavers

140 search results - page 21 / 28
» Optimal Point Correspondence through the Use of Rank Constra...
Sort
View
ICDM
2003
IEEE
92views Data Mining» more  ICDM 2003»
14 years 28 days ago
Postprocessing Decision Trees to Extract Actionable Knowledge
Most data mining algorithms and tools stop at discovered customer models, producing distribution information on customer profiles. Such techniques, when applied to industrial pro...
Qiang Yang, Jie Yin, Charles X. Ling, Tielin Chen
AAAI
2007
13 years 10 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
JISE
2006
76views more  JISE 2006»
13 years 7 months ago
Process and Planning Support for Iterative Porting
in an abstract Cartesian space of program versions characterized by dialect variables. An optimal solution to the problem is derived based on its translation to a restricted Intege...
Pradeep Varma
CVPR
2012
IEEE
11 years 10 months ago
Discovering and exploiting 3D symmetries in structure from motion
Many architectural scenes contain symmetric or repeated structures, which can generate erroneous image correspondences during structure from motion (Sfm) computation. Prior work h...
Andrea Cohen, Christopher Zach, Sudipta N. Sinha, ...
ICPR
2008
IEEE
14 years 8 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson