CS273a Lecture 4, Autumn 08, Batzoglou Hierarchical Sequencing.
On Burstiness-Aware Search for Document Sequences Theodoros Lappas Benjamin Arai Manolis Platakis Dimitrios Kotsakos Dimitrios Gunopulos SIGKDD 2009.
Probabilistically Checkable Proofs Madhu Sudan MIT CSAIL.
CS 61B Data Structures and Programming Methodology
Open Problem 24 Polygonal Curve Simplification From the Open Problems Project
On the Approximability of Geometric and Geographic Generalization and the Min- Max Bin Covering Problem Michael T. Goodrich Dept. of Computer Science joint.
Towards Scalable Critical Alert Mining
Book
Authors: Lan Liu & Tao Jiang, Univ. California, Riverside
Using Views to Implement Datalog Programs
Towards Scalable Critical Alert Mining Bo Zong 1 with Yinghui Wu 1, Jie Song 2, Ambuj K. Singh 1, Hasan Cam 3, Jiawei Han 4, and Xifeng Yan 1 1 UCSB, 2.
Some Algorithmic Problems Concerning the Inference and Analysis of TagSNPs, Haplotypes and Pedigrees PH.D candidate: Lan Liu Advisor: Tao Jiang.
