151 search results - page 27 / 31 » Computable Shell Decomposition Bounds |
132
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
MP
2008
14 years 11 months ago
2008
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
SMA
2003
ACM
15 years 4 months ago
2003
ACM
This paper presents a new method to compute constructive solid geometry (CSG) tree representations of an object whose faces consist of planar and non-planar surfaces. The algorith...
105
click to vote
PARA
1995
Springer
15 years 3 months ago
1995
Springer
Abstract. ScaLAPACK is a library of high performance linear algebra routines for distributed memory MIMD computers. It is a continuation of the LAPACK project, which designed and p...