Sciweavers

2188 search results - page 34 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
COMPGEOM
2005
ACM
13 years 10 months ago
Finding the best shortcut in a geometric network
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmu...
COLT
2004
Springer
14 years 2 months ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum
ESA
2004
Springer
117views Algorithms» more  ESA 2004»
14 years 2 months ago
Classroom Examples of Robustness Problems in Geometric Computations
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan ...
VCIP
2003
178views Communications» more  VCIP 2003»
13 years 10 months ago
Geometrical image compression with bandelets
This paper introduces a new class of bases, called bandelet bases, which decompose the image along multiscale vectors that are elongated in the direction of a geometric flow. Thi...
Erwan Le Pennec, Stéphane Mallat
JCB
2000
90views more  JCB 2000»
13 years 8 months ago
Geometric Invariant Core for the CL and CH1 Domains of Immunoglobulin Molecules
A previously developed algorithmic method for identifying a geometric invariant of protein structures, termed geometrical core, is extended to the and 1 domains of immunoglobulin ...
Ognyan Stoyanov, Alexander Kister, Israel Gelfand,...