Sciweavers

112 search results - page 3 / 23
» Distributed anonymous discrete function computation
Sort
View
ICPR
2010
IEEE
14 years 2 months ago
Integrating a Discrete Motion Model into GMM Based Background Subtraction
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
Christian Wolf, Jolion Jolion
ICPR
2010
IEEE
14 years 2 months ago
Fast and Accurate Approximation of the Euclidean Opening Function in Arbitrary Dimension
In this paper, we present a fast and accurate approximation of the Euclidean opening function which is a wide-used tool in morphological mathematics to analyze binary shapes since...
David Coeurjolly
MOBICOM
2010
ACM
13 years 7 months ago
Privacy vulnerability of published anonymous mobility traces
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
IPPS
2007
IEEE
14 years 1 months ago
Pseudo Trust: Zero-Knowledge Based Authentication in Anonymous Peer-to-Peer Protocols
Most of the current trust models in peer-to-peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer’s ide...
Li Lu, Jinsong Han, Lei Hu, Jinpeng Huai, Yunhao L...
PODC
2010
ACM
13 years 11 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela