Sciweavers

2434 search results - page 224 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
DM
2006
92views more  DM 2006»
15 years 4 months ago
Minimal triangulations of graphs: A survey
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal tr...
Pinar Heggernes
TROB
2002
88views more  TROB 2002»
15 years 4 months ago
Gripper point contacts for part alignment
-- The initial resting pose of many industrial parts differs from the orientation desired for assembly. We show that it is possible to align parts during grasping using a standard ...
Mike Tao Zhang, Ken Goldberg
SIAMJO
2011
14 years 11 months ago
Prox-Penalization and Splitting Methods for Constrained Variational Problems
This paper is concerned with the study of a class of prox-penalization methods for solving variational inequalities of the form Ax + NC (x) 0 where H is a real Hilbert space, A : H...
Hedy Attouch, Marc-Olivier Czarnecki, Juan Peypouq...
SOCO
2012
Springer
13 years 12 months ago
Variable mesh optimization for continuous optimization problems
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
Amilkar Puris, Rafael Bello, Daniel Molina, Franci...
COMPGEOM
2010
ACM
15 years 9 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park