2638 search results - page 354 / 528 » Random Geometric Complexes |
183
click to vote
MOBICOM
2004
ACM
15 years 12 months ago
2004
ACM
Interactive communications among nodes in Vehicular Ad Hoc Networks (VANET) and the safety-oriented nature of many VANET applications necessitate a robust security framework. An a...
159
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
170
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...
196
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
177
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...