1140 search results - page 205 / 228 » Sports over a distance |
92
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
109
Voted
CHI
2002
ACM
16 years 1 months ago
2002
ACM
When virtual teams need to establish trust at a distance, it is advantageous for them to use rich media to communicate. We studied the emergence of trust in a social dilemma game ...
193
Voted
SIGMOD
2008
ACM
16 years 26 days ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
122
click to vote
PERCOM
2008
ACM
16 years 9 days ago
2008
ACM
Existing code update protocols for reprogramming nodes in a sensor network are either unsuitable or inefficient when used in a mobile environment. The prohibitive factor of uncert...
93
Voted
MOBIHOC
2008
ACM
16 years 9 days ago
2008
ACM
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...