2252 search results - page 252 / 451 » Lower Bounds for Dynamic Algorithms |
149
Voted
APN
2010
Springer
15 years 1 months ago
2010
Springer
Workflow mining is the task of automatically producing a workflow model from a set of event logs recording sequences of workflow events; each sequence corresponds to a use case or ...
147
click to vote
EUROCRYPT
2012
Springer
13 years 6 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
196
Voted
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
The parallel packet switch (PPS) extends the inverse multiplexing architecture, and is extensively used as the core of contemporary commercial switches. A key factor in the perfor...
131
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
139
click to vote
NCA
2007
IEEE
15 years 10 months ago
2007
IEEE
Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that such services deal with dynamically changing membership and...