Sciweavers

300 search results - page 30 / 60
» A study on the value of location privacy
Sort
View
GLOBECOM
2006
IEEE
14 years 2 months ago
Toposemantic Network Clustering
— We study the problem of building an optimal network-layer clustering hierarchy, where the optimality can be defined using three potentially conflicting metrics: state, delay ...
Leonid B. Poutievski, Kenneth L. Calvert, Jim Grif...
OOPSLA
2000
Springer
14 years 10 days ago
Scalable propagation-based call graph construction algorithms
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
Frank Tip, Jens Palsberg
CCS
2010
ACM
13 years 7 months ago
Designs to account for trust in social network-based sybil defenses
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim
WOWMOM
2006
ACM
110views Multimedia» more  WOWMOM 2006»
14 years 2 months ago
Entrapping Adversaries for Source Protection in Sensor Networks
Sensor networks are used in a variety of application areas for diverse problems from habitat monitoring to military tracking. Whenever they are used to monitor sensitive objects, ...
Yi Ouyang, Zhengyi Le, Guanling Chen, James Ford, ...
MOBICOM
2004
ACM
14 years 2 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu