503 search results - page 56 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
108
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
119
Voted
STACS
2004
Springer
15 years 8 months ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
145
Voted
TASE
2010
IEEE
14 years 10 months ago
2010
IEEE
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
127
click to vote
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
127
Voted
EVOW
2010
Springer
15 years 7 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...