Sciweavers

479 search results - page 65 / 96
» An Algebra of Pareto Points
Sort
View
CVPR
2011
IEEE
13 years 3 months ago
Reduced Epipolar Cost for Accelerated Incremental SfM
We propose a reduced algebraic cost based on pairwise epipolar constraints for the iterative refinement of a multiple view 3D reconstruction. The aim is to accelerate the intermedi...
A. L. Rodriguez, P E. Lopez-de-Teruel, A. Ruiz
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
14 years 7 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
ISSTA
2009
ACM
14 years 2 months ago
Run-time conformance checking of mobile and distributed systems using executable models
This paper describes an approach for conformance testing of mobile and distributed systems. The approach is based on kiltera — a novel, high-level language supporting the descri...
Ahmad A. Saifan, Ernesto Posse, Jürgen Dingel
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
14 years 1 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...
COMPGEOM
2001
ACM
14 years 1 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...