4212 search results - page 693 / 843 » On Compressible Pairings and Their Computation |
162
click to vote
EWSN
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. This paper investigates postmortem timestamp reconstruction in environmental monitoring networks. In the absence of a timesynchronization protocol, these networks use mul...
142
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
146
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract In a load balancing network each processor has an initial collection of unit-size jobs, tokens, and in each round, pairs of processors connected by balancers split their l...
267
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...
149
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...