Sciweavers

Share
980 search results - page 196 / 196
» cases 2011
Sort
View
APBPM
2013
80views more  APBPM 2013»
5 years 2 months ago
Process Cubes: Slicing, Dicing, Rolling Up and Drilling Down Event Data for Process Mining
Recent breakthroughs in process mining research make it possible to discover, analyze, and improve business processes based on event data. The growth of event data provides many op...
Wil M. P. van der Aalst
BIRTHDAY
2016
Springer
3 years 3 months ago
An Improved Differential Attack on Full GOST
Abstract. GOST 28147-89 is a well-known block cipher and the official encryption standard of the Russian Federation. A 256-bit block cipher considered as an alternative for AES-25...
Nicolas T. Courtois
INNOVATIONS
2016
43views more  INNOVATIONS 2016»
3 years 3 months ago
Secure Multiparty Computation with General Interaction Patterns
abstract of this work published in ITCS 2016 We present a unified framework for studying secure multi-party computation (MPC) with arbitrarily restricted interaction patterns. Ou...
Shai Halevi, Yuval Ishai, Abhishek Jain, Eyal Kush...
BMCBI
2011
8 years 2 months ago
PileLine: a toolbox to handle genome position information in next-generation sequencing studies
Background: Genomic position (GP) files currently used in next-generation sequencing (NGS) studies are always difficult to manipulate due to their huge size and the lack of approp...
Daniel Glez-Peña, Gonzalo Gómez-L&oa...
ICALP
2011
Springer
7 years 10 months ago
Improved Approximation for the Directed Spanner Problem
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...
books