| Login | Create Account |
Items where Project is "Miscellaneous" and Year is 2001
Jump to: Adaptive Algorithms for Set Containment Joins (Technical Report) | An O(n^3) Agenda-Based Chart Parser for Arbitrary Probabilistic Context-Free Grammars | Applying Hierarchical Classification Techniques Without A Hierarchy | Distributional Phrase Structure Induction | Divide-and-Conquer Algorithm for Computing Set Containment Joins (Extended Technical Report) | Exploiting Hierarchical Domain Structure to Compute Similarity | Model-Based Semantic Compression for Network-Data Tables | Multistack Decoding in Statistical Machine Translation | Music Database Retrieval Based on Spectral Similarity | Parsing and Hypergraphs | Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank | Publish/Subscribe Tree Construction in Wireless Ad-Hoc Networks | Publish/Subscribe in a Mobile Environment | Replicated condition monitoring | Routing Indices For Peer-to-Peer Systems | SPARTAN: A Model-Based Semantic Compression System for Massive Data Tables | SimRank: A Measure of Structural-Context Similarity | Similarity Search on the Web: Evaluation and Scalability Considerations Number of items: 18.
Adaptive Algorithms for Set Containment Joins (Technical Report)Melnik, Sergey and Garcia-Molina, Hector (2001) Adaptive Algorithms for Set Containment Joins (Technical Report). Technical Report. Stanford. An O(n^3) Agenda-Based Chart Parser for Arbitrary Probabilistic Context-Free GrammarsKlein, Dan and Manning, Christopher D. (2001) An O(n^3) Agenda-Based Chart Parser for Arbitrary Probabilistic Context-Free Grammars. Technical Report. Stanford. Applying Hierarchical Classification Techniques Without A HierarchyChavira, Mark and Wong, Dik Kin and Manning, Christopher (2001) Applying Hierarchical Classification Techniques Without A Hierarchy. Technical Report. Stanford. Distributional Phrase Structure InductionKlein, Dan and Manning, Christopher D. (2001) Distributional Phrase Structure Induction. In: Conference on Computational Natural Language Learning (CoNLL-2001), July 6-7, 2001, Toulouse, France. Divide-and-Conquer Algorithm for Computing Set Containment Joins (Extended Technical Report)Melnik, Sergey and Garcia-Molina, Hector (2001) Divide-and-Conquer Algorithm for Computing Set Containment Joins (Extended Technical Report). Technical Report. Stanford. Exploiting Hierarchical Domain Structure to Compute SimilarityGanesan, Prasanna and Garcia-Molina, Hector and Widom, Jennifer (2001) Exploiting Hierarchical Domain Structure to Compute Similarity. Technical Report. Stanford. Model-Based Semantic Compression for Network-Data TablesShivnath, Babu and Garofalakis, Minos and Rastogi, Rajeev and Silberschatz, Avi (2001) Model-Based Semantic Compression for Network-Data Tables. In: Workshop on Network-Related Data Management (NRDM 2001), May 25, 2001, Santa Barbara, California. Multistack Decoding in Statistical Machine TranslationJahr, Michael E. (2001) Multistack Decoding in Statistical Machine Translation. Technical Report. Stanford. Music Database Retrieval Based on Spectral SimilarityYang, Cheng (2001) Music Database Retrieval Based on Spectral Similarity. Technical Report. Stanford. Parsing and HypergraphsKlein, Dan and Manning, Christopher D. (2001) Parsing and Hypergraphs. In: Seventh International Workshop on Parsing Technologies (IWPT- 2001), October 17-19, 2001, Beijing, China. Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn TreebankKlein, Dan and Manning, Christopher D. (2001) Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank. In: 39th Annual Meeting on Association for Computational Linguistics (ACL 2001) , July 06 - 11, 2001, Toulouse, France. Publish/Subscribe Tree Construction in Wireless Ad-Hoc NetworksHuang, Yongqiang and Garcia-Molina, Hector (2001) Publish/Subscribe Tree Construction in Wireless Ad-Hoc Networks. Technical Report. Stanford. Publish/Subscribe in a Mobile EnvironmentHuang, Yongqiang and Garcia-Molina, Hector (2001) Publish/Subscribe in a Mobile Environment. In: 2nd ACM International Workshop on Data Engineering for Wireless and Mobile Access (MobiDE 2001) , May 20, 2001, Santa Barbara, California. Replicated condition monitoringHuang, Yongqiang Huang and Garcia-Molina, Hector (2001) Replicated condition monitoring. Technical Report. Stanford. Routing Indices For Peer-to-Peer SystemsCrespo, Arturo and Garcia-Molina, Hector (2001) Routing Indices For Peer-to-Peer Systems. Technical Report. Stanford. SPARTAN: A Model-Based Semantic Compression System for Massive Data TablesShivnath, Babu and Garofalakis, Minos and Rastogi, Rajeev (2001) SPARTAN: A Model-Based Semantic Compression System for Massive Data Tables. In: International Conference on Management of Data (SIGMOD 2001), May 21-24, 2001, Santa Barbara, California. SimRank: A Measure of Structural-Context SimilarityJeh, Glen and Widom, Jennifer (2001) SimRank: A Measure of Structural-Context Similarity. Technical Report. Stanford. Similarity Search on the Web: Evaluation and Scalability ConsiderationsHaveliwala, Taher and Gionis, Aristides and Klein, Dan and Indyk, Piotr (2001) Similarity Search on the Web: Evaluation and Scalability Considerations. Technical Report. Stanford. |
