Sciweavers

401 search results - page 48 / 81
» Algorithms for a Simple Point Placement Problem
Sort
View
COLT
2004
Springer
15 years 5 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
VIS
2004
IEEE
139views Visualization» more  VIS 2004»
16 years 1 months ago
Compatible Triangulations of Spatial Decompositions
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
Berk Geveci, Mathieu Malaterre, William J. Schroed...
COMPGEOM
1998
ACM
15 years 4 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan
ICML
2003
IEEE
16 years 18 days ago
Learning Distance Functions using Equivalence Relations
We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a sim...
Aharon Bar-Hillel, Tomer Hertz, Noam Shental, Daph...
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
15 years 6 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee