2374 search results - page 7 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
ARITH
1997
IEEE
13 years 12 months ago
1997
IEEE
SAC
2006
ACM
14 years 1 months ago
2006
ACM
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...