417 search results - page 55 / 84 » Constructing Call Multigraphs Using Dependence Graphs |
IJSN
2006
14 years 11 months ago
2006
In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new ...
214
click to vote
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
We propose a novel tracking framework called visual tracker sampler that tracks a target robustly by searching for the appropriate trackers in each frame. Since the real-world trac...
MOBIHOC
2006
ACM
15 years 11 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
137
click to vote
TNN
2010
14 years 6 months ago
2010
Clustering using the Hilbert Schmidt independence criterion (CLUHSIC) is a recent clustering algorithm that maximizes the dependence between cluster labels and data observations ac...
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...