9949 search results - page 1864 / 1990 » On the Network Complexity of Selection |
FGCS
2002
13 years 8 months ago
2002
Initial versions of MPI were designed to work efficiently on multi-processors which had very little job control and thus static process models. Subsequently forcing them to suppor...
IDA
2002
Springer
13 years 8 months ago
2002
Springer
Most classification methods are based on the assumption that the data conforms to a stationary distribution. However, the real-world data is usually collected over certain periods...
SIAMJO
2000
13 years 8 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
CGF
1998
13 years 8 months ago
1998
A multiresolution data decomposition offers a fundamental framework supporting compression, progressive transmission, and level-of-detail (LOD) control for large two or three dime...
DAM
1998
13 years 8 months ago
1998
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...