Other Databases Indexing TRIZ Cases
- Precision Propagation in Machine Learning Computation Graphs
Adjusting operator precision levels across directed computation graphs to optimize numerical processing workflows.
- Inverted Index Reference Values for Event Record Retrieval
Storing reference values in an inverted index reduces storage requirements and computational overhead while improving query speed for machine-generated data.
- Contextualizing Engine for Organizational Data Identification
A contextualizing engine analyzes activity signals to identify individuals and surface relevant information through a graph structure.
- Relational Database Probabilistic Graphical Model for Data Quality
Probabilistic graphical models infer missing data and detect errors to resolve manual verification bottlenecks.
- Nested Hash Map Memory Optimization in EDA Systems
Nested hash maps use shared pointers to eliminate duplicate data, resolving exponential memory growth in electronic design automation systems.
- NetTree Network Data Visualization with Hierarchical Segmentation
NetTree application segments complex network data into a hierarchical tree structure, decluttering visual space while preserving parentage and node properties.
- Keyword Search Over Knowledge Graphs Using Static Labels
Static labels containing vertex distances reduce run time for keyword queries over large knowledge graphs.
- Two-Pass Graph Path Query Processing
Segmenting graph traversal into breadth-first and depth-first passes reduces temporal complexity for large database queries.
- Fault Propagation Extraction via Graph Embedding
Automated graph processing replaces manual summarization to improve fault coverage rates while reducing labor costs in communications networks.