2638 search results - page 47 / 528 » Random Geometric Complexes |
140
click to vote
TSP
2010
14 years 9 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
131
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
106
click to vote
ALGORITHMICA
2002
15 years 2 months ago
2002
The implementation of an algorithm is faced with the issues efficiency, flexibility, and ease-of-use. In this paper, we suggest a design concept that greatly increases the flexibi...
ICRA
2010
IEEE
15 years 28 days ago
2010
IEEE
Abstract— We present a novel vision-based grasp point detection algorithm that can reliably detect the corners of a piece of cloth, using only geometric cues that are robust to v...
120
click to vote
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...