Mostra 791 - 800 risultati di 1.181 ricerca '"Complexes."', tempo di risposta: 0,02s Raffina i risultati
  1. 791

    Polynomial-time data reduction for dominating set. di Alber, Jochen

    Pubblicato in Journal of the ACM
    Articolo

    Polynomial-time data reduction for dominating set.
  2. 792

    Smoothed analysis of algorithms Why the simplex algorithm usually takes polynomial time. di Spielman, Daniel A.

    Pubblicato in Journal of the ACM
    Articolo

    Smoothed analysis of algorithms Why the simplex algorithm usually takes polynomial time.
  3. 793

    Lower bounds on the bounded coefficient complexity of bilinear maps. di Bürgisser, Peter

    Pubblicato in Journal of the ACM
    Articolo

    Lower bounds on the bounded coefficient complexity of bilinear maps.
  4. 794

    On clusterings good, bad and spectral. di Kannan, Ravi

    Pubblicato in Journal of the ACM
    Articolo

    On clusterings good, bad and spectral.
  5. 795

    Structural Extension to Logistic Regression Discriminative Parameter Learning of Belief Net Classifiers. di Greiner, Russell

    Pubblicato in Machine learning.
    Articolo

    Structural Extension to Logistic Regression Discriminative Parameter Learning of Belief Net Classifiers.
  6. 796

    Programming by Demonstration Using Version Space Algebra. di Lau, Tessa

    Pubblicato in Machine learning.
    Articolo

    Programming by Demonstration Using Version Space Algebra.
  7. 797

    Mobile routing for large scale all-IP wireless network. di Li, Hongyi

    Articolo

    Mobile routing for large scale all-IP wireless network.
  8. 798

    Routing and handoff in the edge mobility architecture. di O'Neill, Alan

    Articolo

    Routing and handoff in the edge mobility architecture.
  9. 799

    Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system. di Pan, Yi

    Articolo

    Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system.
  10. 800

    Boolean circuits, tensor ranks and communication complexity. di Pudlak, Pavel

    Articolo

    Boolean circuits, tensor ranks and communication complexity.

Strumenti per la ricerca: