Mostrar 131 - 140 resultats de 294 per cerca '"Discretization."', hora de la petició: 0.02sec Refinar resultats
  1. 131

    Conflict-free channel assignment for an optical cluster-based shuffle network configuration. per Aly, Khaled A.

    Article

    Conflict-free channel assignment for an optical cluster-based shuffle network configuration.
  2. 132

    Routing reserved bandwith multi-point connections. per Verma, Dinesh C.

    Article

    Routing reserved bandwith multi-point connections.
  3. 133

    Structural complexity and execution efficiency of distributed application protocols. per Ravindran, K.

    Article

    Structural complexity and execution efficiency of distributed application protocols.
  4. 134

    Asymmetric k-center is log* n-hard to approximate. per Chuzhoy, Julia

    Publicat a Journal of the ACM
    Article

    Asymmetric k-center is log* n-hard to approximate.
  5. 135

    Boosting textual compression in optimal linear time. per Ferragina, Paolo

    Publicat a Journal of the ACM
    Article

    Boosting textual compression in optimal linear time.
  6. 136

    Edge-disjoint routing in plane switch graphs in linear time. per Hochstein, J.M

    Publicat a Journal of the ACM
    Article

    Edge-disjoint routing in plane switch graphs in linear time.
  7. 137

    Explicit OR-dispersers with polylogarithmic degree. per Saks, Michael

    Publicat a Journal of the ACM
    Article

    Explicit OR-dispersers with polylogarithmic degree.
  8. 138

    A new general derandomization method. per Andreev, Alexander E.

    Publicat a Journal of the ACM
    Article

    A new general derandomization method.
  9. 139

    Sparsification-a technique for speeding up dynamic graph algorithms. per Eppstein, David

    Publicat a Journal of the ACM
    Article

    Sparsification-a technique for speeding up dynamic graph algorithms.
  10. 140

    Time-work tradeoffs for parallel algorithms. per Spencer, Thomas H.

    Publicat a Journal of the ACM
    Article

    Time-work tradeoffs for parallel algorithms.

Eines de cerca: