1973 search results - page 136 / 395 » The Construction of Ludic Space |
155
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
The aim of this paper is to present a construction of t-divisible designs for t > 3, because such divisible designs seem to be missing in the literature. To this end, tools suc...
137
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
– Identifying worst-case voltage drop conditions in every module supplied by the power grid is a crucial problem in modern IC design. In this paper we develop a novel methodology...
151
click to vote
FOCS
2007
IEEE
16 years 22 days ago
2007
IEEE
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
187
click to vote
ICMCS
2007
IEEE
16 years 21 days ago
2007
IEEE
Speaker verification is a technology of verifying the claimed identity of a speaker based on the speech signal from the speaker (voice print). To learn the score of similarity be...
178
click to vote
CPM
2010
Springer
15 years 11 months ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...