Sciweavers

796 search results - page 82 / 160
» The Anonymous Subgraph Problem
Sort
View
ASIACRYPT
2000
Springer
15 years 5 months ago
A Length-Invariant Hybrid Mix
This paper presents a secure and flexible Mix-net that has the following properties; it efficiently handles long plaintexts that exceed the modulus size of underlying public-key e...
Miyako Ohkubo, Masayuki Abe
139
Voted
DIAU
2000
Springer
15 years 5 months ago
On Pseudonymization of Audit Data for Intrusion Detection
In multilaterally secure intrusion detection systems (IDS) anonymity and accountability are potentially conflicting requirements. Since IDS rely on audit data to detect violations...
Joachim Biskup, Ulrich Flegel
157
Voted
OL
2011
242views Neural Networks» more  OL 2011»
14 years 7 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
132
Voted
WWW
2007
ACM
16 years 1 months ago
Extraction and classification of dense communities in the web
The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information and services, and there is a growing interest in tools for understandi...
Yon Dourisboure, Filippo Geraci, Marco Pellegrini
125
Voted
PPOPP
2006
ACM
15 years 6 months ago
On-line automated performance diagnosis on thousands of processes
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
Philip C. Roth, Barton P. Miller