Treffer 51 - 60 von 63 für Suche 'Computational complexity 0 Computer algorithms.', Suchdauer: 0,04s Treffer weiter einschränken
  1. 51

    An iterative hillclimbing algorithm for discrete optimization on images application to joint encoding of image transform coefficients. von Bunyaratavej, P.

    Veröffentlicht in IEEE Signal processing letters
    Artikel

    An iterative hillclimbing algorithm for discrete optimization on images application to joint encoding of image transform coefficients.
  2. 52

    Indexing compressed text. von Ferragina, Paolo

    Veröffentlicht in Journal of the ACM
    Artikel

    Indexing compressed text.
  3. 53

    Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. von Kaplan, Haim

    Veröffentlicht in Journal of the ACM
    Artikel

    Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.
  4. 54

    Almost tight upper bounds for vertical decompositions in four dimensions. von Koltun, Vladlen

    Veröffentlicht in Journal of the ACM
    Artikel

    Almost tight upper bounds for vertical decompositions in four dimensions.
  5. 55

    Resolution lower bounds for the weak pigeonhole principle. von Raz, R.

    Veröffentlicht in Journal of the ACM
    Artikel

    Resolution lower bounds for the weak pigeonhole principle.
  6. 56

    Quantum lower bounds by polynomials. von Beals, Robert

    Veröffentlicht in Journal of the ACM
    Artikel

    Quantum lower bounds by polynomials.
  7. 57

    Some optimal inapproximability results. von Håstad, Johan

    Veröffentlicht in Journal of the ACM
    Artikel

    Some optimal inapproximability results.
  8. 58

    Incorporating error shaping technique into LSF vector quantization. von Hsi-Wen Nein

    Artikel

    Incorporating error shaping technique into LSF vector quantization.
  9. 59

    Compact oracles for reachability and approximate distances in planar diagraphs. von Thorup, M.

    Veröffentlicht in Journal of the ACM
    Artikel

    Compact oracles for reachability and approximate distances in planar diagraphs.
  10. 60

    Approximating extent measures of points. von Agarwal, Pankaj K.

    Veröffentlicht in Journal of the ACM
    Artikel

    Approximating extent measures of points.

Suchwerkzeuge: