Imagen de Portada

TIMEST: Temporal Information Motif Estimator Using Sampling Trees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Pan, Yunjie, Bhalerao, Omkar, Seshadhri, C., Talati, Nishil
Formato:	Preprint
Publicado:	2025
Materias:	Databases Data Structures and Algorithms Information Retrieval
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
por: Pan, Yunjie, et al.
Publicado: (2024)

Triadic First-Order Logic Queries in Temporal Networks
por: Bhalerao, Omkar, et al.
Publicado: (2025)

Linked Array Tree: A Constant-Time Search Structure for Big Data
por: Liu, Songpeng
Publicado: (2025)

Efficiently Constructing Sparse Navigable Graphs
por: Conway, Alex, et al.
Publicado: (2025)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
por: Wang, Carrie, et al.
Publicado: (2025)

jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
por: Tabei, Yasuo
Publicado: (2025)

SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
por: Li, Hui, et al.
Publicado: (2025)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
por: Iff, Patrick, et al.
Publicado: (2025)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
por: Gao, Jianyang, et al.
Publicado: (2024)

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
por: Coleman, Benjamin, et al.
Publicado: (2023)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
por: Shi, Jifan, et al.
Publicado: (2026)

Diversity-Aware $k$-Maximum Inner Product Search Revisited
por: Huang, Qiang, et al.
Publicado: (2024)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
por: Zhao, Fuheng, et al.
Publicado: (2023)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
por: Xu, Yuexuan, et al.
Publicado: (2024)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
por: Dhulipala, Laxman, et al.
Publicado: (2024)

Correlation Sketches for Approximate Join-Correlation Queries
por: Santos, Aécio, et al.
Publicado: (2021)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
por: Gao, Jianyang, et al.
Publicado: (2024)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
por: Azizi, Ilias, et al.
Publicado: (2025)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
por: Al-Jazzazi, Yousef, et al.
Publicado: (2025)

Model-Free Counterfactual Subset Selection at Scale
por: Nguyen, Minh Hieu, et al.
Publicado: (2025)

Retrieval with Learned Similarities
por: Ding, Bailu, et al.
Publicado: (2024)

Counting hypertriangles through hypergraph orientations
por: Paul-Pena, Daniel, et al.
Publicado: (2026)

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
por: Basu, Sabyasachi, et al.
Publicado: (2024)

COPR -- Efficient, large-scale log storage and retrieval
por: Reichinger, Julian, et al.
Publicado: (2024)

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
por: Zhang, Ziyu, et al.
Publicado: (2025)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
por: Dhulipala, Laxman, et al.
Publicado: (2023)

Access Control for Information-Theoretically Secure Key-Document Stores
por: Li, Yin, et al.
Publicado: (2025)

Protecting participants or population? Comparison of k-anonymous Origin-Destination matrices
por: Armenante, Pietro, et al.
Publicado: (2025)

Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism
por: Faro, Simone, et al.
Publicado: (2025)

Foundations of Vector Retrieval
por: Bruch, Sebastian
Publicado: (2024)

On the LSH Distortion of Ulam and Cayley Similarities
por: Chierichetti, Flavio, et al.
Publicado: (2026)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
por: Xu, Zhenxiang, et al.
Publicado: (2024)

Fast and exact fixed-radius neighbor search based on sorting
por: Chen, Xinye, et al.
Publicado: (2022)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
por: Wang, Honglian, et al.
Publicado: (2026)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
por: Zhang, Tian, et al.
Publicado: (2026)

Hierarchical Locality Sensitive Hashing for Structured Data: A Survey
por: Wu, Wei, et al.
Publicado: (2022)

An Effective Tag Assignment Approach for Billboard Advertisement
por: Ali, Dildar, et al.
Publicado: (2024)

Average Case Graph Searching in Non-Uniform Cost Models
por: Szyfelbein, Michał
Publicado: (2026)

Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space
por: Lebeda, Christian Janos, et al.
Publicado: (2024)

Deterministic Retrieval at Scale: Optimal-Space LCP Indexing and 308x Energy Reduction on Modern GPUs
por: Byriukov, Stanislav
Publicado: (2026)