505 search results - page 30 / 101 » Message from General Co-Chairs |
108
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special ...
150
click to vote
IM
2008
15 years 3 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
123
click to vote
SIGSOFT
2010
ACM
15 years 1 months ago
2010
ACM
The global interaction behavior in message-based systems can be specified as a finite-state machine defining acceptable sequences of messages exchanged by a group of peers. Realiz...
114
click to vote
CHI
2011
ACM
14 years 7 months ago
2011
ACM
In this paper we argue that Musicons, short samples from pieces of music are a useful way to present private but memorable reminder messages. We investigated accuracy, memorabilit...
140
Voted
WWW
2008
ACM
16 years 4 months ago
2008
ACM
This paper presents a general framework for building classifiers that deal with short and sparse text & Web segments by making the most of hidden topics discovered from larges...