Colored intersection searching via sparse rectangular matrix multiplication
- 5 June 2006
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the twenty-second annual symposium on Computational geometry - SCG '06
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Learning functions of k relevant variablesJournal of Computer and System Sciences, 2004
- Computing all large sums-of-pairs in
R Information Processing Letters, 2004 - Fast context-free grammar parsing requires fast boolean matrix multiplicationJournal of the ACM, 2002
- Fast Rectangular Matrix Multiplication and ApplicationsJournal of Complexity, 1998
- Rectangular Matrix Multiplication RevisitedJournal of Complexity, 1997
- New lower bounds for Hopcroft's problemDiscrete & Computational Geometry, 1996
- Red-Blue Intersection Reporting for Objects of Non-Constant SizeThe Computer Journal, 1996
- Motion segmentation and qualitative dynamic scene analysis from an image sequenceInternational Journal of Computer Vision, 1993
- Cutting hyperplanes for divide-and-conquerDiscrete & Computational Geometry, 1993
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990