3717 search results - page 165 / 744 » Representing Multiple Theories |
151
Voted
SIAMCOMP
2008
15 years 3 months ago
2008
Abstract. We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key c...
112
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
nalysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granular...
106
Voted
TIT
2010
14 years 10 months ago
2010
The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new ...
150
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—We consider a cognitive radio network where multiple secondary users (SUs) contend for spectrum usage, using random access, over available primary user (PU) channels. Ou...
110
Voted
NORDICHI
2006
ACM
15 years 9 months ago
2006
ACM
Users should be involved in the development of information technology (IT) artifacts. However, this is challenging, especially in product development context, in which Human Compu...