Showing 261 - 270 results of 389 for search 'Journal of algorithms.', tempo de consulta: 0.02s Limitar resultados
  1. 261

    Improved implementations of binary universal operations. por Attiya, Hagit

    Publicado en Journal of the ACM
    Artigo

    Improved implementations of binary universal operations.
  2. 262

    An efficient algorithm for image segmentation, Markov random fields and related problems. por Hochbaum, Dorit S.

    Publicado en Journal of the ACM
    Artigo

    An efficient algorithm for image segmentation, Markov random fields and related problems.
  3. 263

    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. por Holm, Jacob

    Publicado en Journal of the ACM
    Artigo

    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.
  4. 264

    A combinatorial strongly polynomial algorithm for minimizing submodular functions. por Iwata, Satoru

    Publicado en Journal of the ACM
    Artigo

    A combinatorial strongly polynomial algorithm for minimizing submodular functions.
  5. 265

    Quantum lower bounds by polynomials. por Beals, Robert

    Publicado en Journal of the ACM
    Artigo

    Quantum lower bounds by polynomials.
  6. 266

    Some optimal inapproximability results. por Håstad, Johan

    Publicado en Journal of the ACM
    Artigo

    Some optimal inapproximability results.
  7. 267

    Extractors and pseudorandom generators. por Travisan, L.

    Publicado en Journal of the ACM
    Artigo

    Extractors and pseudorandom generators.
  8. 268

    Transforming cabbage into turnip polynomial algorithm for sorting signed permutations by reversals. por Hannenhalli, Sridhar

    Publicado en Journal of the ACM
    Artigo

    Transforming cabbage into turnip polynomial algorithm for sorting signed permutations by reversals.
  9. 269

    Fully dynamic planarity testing with applications. por Galil, Zvi

    Publicado en Journal of the ACM
    Artigo

    Fully dynamic planarity testing with applications.
  10. 270

    Coupling weight elimination with genetic algorithms to reduce network size and preserve generalization. por Bebis, George

    Artigo

    Coupling weight elimination with genetic algorithms to reduce network size and preserve generalization.

Ferramentas de procura: