837 search results - page 17 / 168 » Hard combinators |
VTC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Sharing of the frequency spectrum between licensed primary users and unlicensed secondary users (SUs) requires reliable detection of spectrum occupancy by the SUs. Due to fadin...
CRYPTO
2007
Springer
15 years 4 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
ICFCA
2010
Springer
15 years 5 months ago
2010
Springer
Concept lattices built on noisy data tend to be large and hence hard to interpret. We introduce several measures that can be used in selecting relevant concepts and discuss how the...
ECCC
2007
14 years 10 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
WSCG
2004
14 years 11 months ago
2004
3D scatterplots are an extension of the ubiquitous 2D scatterplots that is conceptually simple, but so far proved hard to use in practice. But by combining them with a state-of-th...