Sciweavers

796 search results - page 64 / 160
» The Anonymous Subgraph Problem
Sort
View
102
Voted
P2P
2003
IEEE
100views Communications» more  P2P 2003»
15 years 6 months ago
Identity Crisis: Anonymity vs. Reputation in P2P Systems
The effectiveness of reputation systems for peer-to-peer resource-sharing networks is largely dependent on the reliability of the identities used by peers in the network. Much deb...
Sergio Marti, Hector Garcia-Molina
MASS
2010
181views Communications» more  MASS 2010»
14 years 10 months ago
Perfectly anonymous data aggregation in wireless sensor networks
Clustering and data aggregation in wireless sensor networks improves scalability, and helps the efficient use of scarce resources. Yet, these mechanisms also introduce some securi...
Levente Buttyán, Tamás Holczer
AUSAI
2008
Springer
15 years 2 months ago
Constraint-Based Multi-agent Path Planning
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
Malcolm Ryan
ICDAR
2009
IEEE
14 years 10 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
114
Voted
CCS
2010
ACM
15 years 4 months ago
Towards publishing recommendation data with predictive anonymization
Recommender systems are used to predict user preferences for products or services. In order to seek better prediction techniques, data owners of recommender systems such as Netfli...
Chih-Cheng Chang, Brian Thompson, Hui (Wendy) Wang...