graph generation, graph neural networks
Generate new graphs.
355 technical terms and definitions
Generate new graphs.
Most expressive message-passing GNN.
Determine if graphs are identical.
Measure graph similarity.
Operator encoding graph structure.
Align nodes between graphs.
GNNs operate on graph-structured data. Message passing between nodes. Social networks, molecules.
Apply Neural ODEs to graph-structured data.
Operators on graph-structured data.
Graph of thoughts represents reasoning as directed graph enabling complex thought processes.
Graph optimization transforms computation graphs improving efficiency through fusion reordering and elimination.
Optimize computation graph.
Graph optimization simplifies computation graph. Constant folding, operator fusion, dead code elimination.
Divide graph into balanced parts.
Downsample graphs in GNNs.
Use knowledge graphs to retrieve connected entities and relationships.
Graph recurrence applies RNNs to sequences of graph snapshots learning temporal graph dynamics.
Graph retrieval leverages knowledge graph structure for contextual information.
Graph serialization stores model structure and parameters in portable format for deployment.
Graph U-Net applies encoder-decoder architecture with skip connections to graphs for node classification.
Upsample graphs.
Variational autoencoder for graphs.
Wavelet transforms on graphs.
Model pose as graph over time.
Graph-based parsing scores all possible arcs and finds the maximum spanning tree for dependency structure prediction.
Use graph networks for relational tasks.
Graph Autoregressive Flow generates graphs by sequentially adding nodes and edges with normalizing flows.
Use graphene for devices.
Graphene-based thermal interface materials leverage high in-plane thermal conductivity for improved heat spreading.
Sequential graph generation.
GraphNVP applies normalizing flows to graph generation enabling exact likelihood computation and efficient sampling of molecular structures.
GraphQL provides flexible queries. Client specifies fields. Efficient data fetching.
GraphRNN generates graphs sequentially by modeling node and edge formation as a sequence generation problem using recurrent neural networks.
RNN-based graph generation.
GraphSAGE generates node embeddings by sampling and aggregating features from local neighborhoods enabling inductive learning on unseen graphs.
Inductive GNN with sampling.
Graph Transformer applies full self-attention over graph nodes with positional encodings for structural information.
Graph Variational Autoencoder generates graphs by learning latent distributions over graph structures.
Gray code changes only one bit between adjacent values preventing multi-bit transition errors.
Surface-sensitive nanostructure analysis.
Thin film crystal structure.
Always pick most likely token.
Greedy decoding always picks highest probability token. Fast but can be repetitive. No exploration.
Always pick the most probable next token (deterministic but can be repetitive).
Greedy decoding picks the highest-prob token each step (deterministic). Beam search explores multiple candidates; sampling adds randomness for variety.
Sheet resistance measurement pattern.
Green chemistry principles minimize hazardous substances in semiconductor processes through alternative chemistries and process optimization.
Environmentally friendly fab design and operations.
Green solvents replace hazardous organic solvents with safer alternatives like supercritical CO2 or water-based solutions.
Grid search tries all combinations. Exhaustive but slow.