Showing 281 - 290 results of 394 for search '"Graphs."', query time: 0.02s Refine Results
  1. 281

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

    Published in Journal of the ACM
    Article

    Sparsification-a technique for speeding up dynamic graph algorithms.
  2. 282

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

    Published in Journal of the ACM
    Article

    Time-work tradeoffs for parallel algorithms.
  3. 283

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

    Published in Journal of the ACM
    Article

    Polynomial-time data reduction for dominating set.
  4. 284

    Coloring k-colorable graphs using relatively small palettes. by Halperin, Eran

    Published in Journal of algorithms.
    Article

    Coloring k-colorable graphs using relatively small palettes.
  5. 285

    Learning Bayesian Network Classifiers Searching in a Space of Partially Directed Acyclic Graphs. by Acid, Silvia

    Published in Machine learning.
    Article

    Learning Bayesian Network Classifiers Searching in a Space of Partially Directed Acyclic Graphs.
  6. 286

    Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces. by Borodin, Allan

    Published in Machine learning.
    Article

    Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces.
  7. 287

    Central Clustering of Attributed Graphs. by Jain, Brijnesh J.

    Published in Machine learning.
    Article

    Central Clustering of Attributed Graphs.
  8. 288

    Semi-Supervised Learning on Riemannian Manifolds. by MIshra, Nina

    Published in Machine learning.
    Article

    Semi-Supervised Learning on Riemannian Manifolds.
  9. 289

    Weighted coloring based channel assignment for WLANs. by Mishra, Arunesh

    Article

    Weighted coloring based channel assignment for WLANs.
  10. 290

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

    Article

    Boolean circuits, tensor ranks and communication complexity.

Search Tools: