GenTUS reformulates table union search as constrained generative retrieval over semantic table identifiers, achieving top retrieval quality on seven benchmarks with lower latency and storage costs.
InProceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces a beam-search heuristic for random subset sum that uses meshing to obtain inverse-quadratic expected error decay in linearithmic time.
citing papers explorer
-
Generative Retrieval for Table Union Search
GenTUS reformulates table union search as constrained generative retrieval over semantic table identifiers, achieving top retrieval quality on seven benchmarks with lower latency and storage costs.
-
Inverse Quadratic Decay in Random Subset Sum
Introduces a beam-search heuristic for random subset sum that uses meshing to obtain inverse-quadratic expected error decay in linearithmic time.