NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 2 of 2 (0.058 seconds)

Spelling suggestions: "subject:"A stor search""

1

Enumerating Approximate Maximal Cliques in a Distributed Framework

Dhanasetty, Abhishek 05 October 2021 (has links)
No description available.
Computer Science
Approximate Maximal Cliques
A-star search algorithm
Triangle Enumeration
Heuristics
Degree Distribution
Clustering Coefficient
2

Multi-Domain Clustering using the A* Search

Gurram, Abhinav 20 October 2016 (has links)
No description available.
Engineering
clustering
bi-clustering
3-clusters
heuristic seach
A star search
multi-domain clustering

Page generated in 0.0628 seconds