Sciweavers

2188 search results - page 114 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
99
Voted
SIAMMAX
2010
123views more  SIAMMAX 2010»
14 years 9 months ago
Joint Spectral Characteristics of Matrices: A Conic Programming Approach
We propose a new approach to estimate the joint spectral radius and the joint spectral subradius of an arbitrary set of matrices. We first restrict our attention to matrices that ...
Vladimir Protasov, Raphaël M. Jungers, Vincen...
IACR
2011
124views more  IACR 2011»
14 years 2 months ago
Group Law Computations on Jacobians of Hyperelliptic Curves
We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the g...
Craig Costello, Kristin Lauter
148
Voted
CVPR
2012
IEEE
13 years 10 months ago
Jigsaw Puzzles with Pieces of Unknown Orientation
This paper introduces new types of square-piece jigsaw puzzles: those for which the orientation of each jigsaw piece is unknown. We propose a tree-based reassembly that greedily me...
Andrew Gallagher
233
Voted
TOG
2012
267views Communications» more  TOG 2012»
13 years 5 months ago
Global parametrization by incremental flattening
Global parametrization of surfaces requires singularities (cones) to keep distortion minimal. We describe a method for finding cone locations and angles and an algorithm for glob...
Ashish Myles, Denis Zorin
128
Voted
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 3 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura