516 search results - page 62 / 104 » Sets of k-Independent Strings |
HYBRID
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper, we consider the problem of generating optimized, executable control code from high-level, symbolic specifications. In particular, we construct symbolic co...
ICVS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Due to stringing time constraints, saliency models are becoming popular tools for building situated robotic systems requiring, for instance, object recognition and vision...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
We propose a method for recognizing human actions in videos. Inspired from the recent bag-of-words approaches, we represent actions as documents consisting of words, where a word ...
LCN
2008
IEEE
14 years 3 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
FSE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Given (deterministic) ciphers E and E that can encipher messages of l and n bits, respectively, we construct a cipher E∗ = XLS[E, E] that can encipher messages of l + s...