Sciweavers

796 search results - page 55 / 160
» The Anonymous Subgraph Problem
Sort
View
OPODIS
2003
15 years 2 months ago
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe,...
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
14 years 10 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu
90
Voted
SOFSEM
2005
Springer
15 years 6 months ago
Anonymous Communication with On-line and Off-line Onion Encoding
Abstract. Anonymous communication with onions requires that a user application determines the whole routing path of an onion. This scenario has certain disadvantages, it might be d...
Marek Klonowski, Miroslaw Kutylowski, Filip Zag&oa...
126
Voted
AINA
2006
IEEE
15 years 4 months ago
ARM: Anonymous Routing Protocol for Mobile Ad hoc Networks
Due to the nature of radio transmissions, communications in wireless networks are easy to capture and analyze. Next to this, privacy enhancing techniques (PETs) proposed for wired...
Stefaan Seys, Bart Preneel
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
16 years 13 days ago
Anonymizing Weighted Social Network Graphs
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
Sudipto Das, Ömer Egecioglu, Amr El Abbadi