Sciweavers

778 search results - page 8 / 156
» Improved universal denominators
Sort
View
ALENEX
2010
156views Algorithms» more  ALENEX 2010»
13 years 8 months ago
Tabulation Based 5-Universal Hashing and Linear Probing
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...
Mikkel Thorup, Yin Zhang
TREC
2000
13 years 8 months ago
Dublin City University Experiments in Connectivity Analysis for TREC-9
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...
Cathal Gurrin, Alan F. Smeaton
SIGUCCS
2000
ACM
13 years 11 months ago
Remedial Help Desk 101 at Florida State University
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...
Diana Orrick, Jeff Bauer, Ernest McDuffie
TRECVID
2008
13 years 8 months ago
Peking University at TRECVID 2008: High Level Feature Extraction
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,...
TCS
2008
13 years 7 months ago
On the weight of universal insertion grammars
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...
Lila Kari, Petr Sosík