Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
Dublin City University (DCU) took part in the Web Track (small task) in TREC-9. Our experiments were based on evaluating a number of connectivity analysis algorithms that we hoped...
The User Services division of the Office of Technology Integration is the "safety net" for computer support at Florida State University (FSU). Areas of support include t...
We participated in one task of TRECVID 2008, that is, the high-level feature extraction (HLFE). This paper presents our approaches and results on the HLFE task. We mainly focus on...
Yuxin Peng, Zhiguo Yang, Jian Yi, Lei Cao, Hao Li,...
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...