2168 search results - page 276 / 434 » Randomized Algorithms and Complexity Theory |
142
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
122
Voted
MOBICOM
2009
ACM
15 years 10 months ago
2009
ACM
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
161
click to vote
CCS
2006
ACM
15 years 7 months ago
2006
ACM
In biometric identification, a fingerprint is typically represented as a set of minutiae which are 2D points. A method [4] to protect the fingerprint template hides the minutiae b...
168
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
123
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...