Sciweavers

1333 search results - page 72 / 267
» Not a Number of Floating Point Problems
Sort
View
122
Voted
ICCV
2005
IEEE
15 years 9 months ago
How Hard is 3-View Triangulation Really?
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
Henrik Stewénius, Frederik Schaffalitzky, D...
COMPGEOM
1990
ACM
15 years 7 months ago
Minimum-Link Paths Among Obstacles in the Plane
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
Joseph S. B. Mitchell, Günter Rote, Gerhard J...
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 3 months ago
Optimal topological simplification of discrete functions on surfaces
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
Ulrich Bauer, Carsten Lange, Max Wardetzky
175
Voted
IJDMB
2008
132views more  IJDMB 2008»
15 years 3 months ago
A Bayesian framework for knowledge driven regression model in micro-array data analysis
: This paper addresses the sparse data problem in the linear regression model, namely the number of variables is significantly larger than the number of the data points for regress...
Rong Jin, Luo Si, Christina Chan
135
Voted
EOR
2007
104views more  EOR 2007»
15 years 3 months ago
Analysis of the constraint proposal method for two-party negotiations
In the constraint proposal method a mediator locates points at which the two decision makers have joint tangent hyperplanes. We give conditions under which these points are Pareto...
Mitri Kitti, Harri Ehtamo