Sciweavers

2168 search results - page 271 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
CCS
2005
ACM
16 years 15 days ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
182
Voted
WWW
2007
ACM
16 years 7 months ago
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography
In a social network, nodes correspond to people or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anon...
Lars Backstrom, Cynthia Dwork, Jon M. Kleinberg
BPM
2009
Springer
168views Business» more  BPM 2009»
16 years 1 months ago
Divide-and-Conquer Strategies for Process Mining
The goal of Process Mining is to extract process models from logs of a system. Among the possible models to represent a process, Petri nets is an ideal candidate due to its graphic...
Josep Carmona, Jordi Cortadella, Michael Kishinevs...
158
Voted
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
16 years 14 days ago
A generator for hierarchical problems
We describe a generator for hierarchical problems called the Hierarchical Problem Generator (HPG). Hierarchical problems are of interest since they constitute a class of problems ...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
194
Voted
COMPGEOM
2003
ACM
16 years 6 days ago
the asteroid surveying problem and other puzzles
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...