Sciweavers

9842 search results - page 1762 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
APPT
2009
Springer
15 years 10 months ago
Computational Performance of a Parallelized Three-Dimensional High-Order Spectral Element Toolbox
In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance...
Christoph Bosshard, Roland Bouffanais, Christian C...
ASIACRYPT
2009
Springer
15 years 10 months ago
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
Vadim Lyubashevsky
BPM
2009
Springer
175views Business» more  BPM 2009»
15 years 10 months ago
Understanding Spaghetti Models with Sequence Clustering for ProM
The goal of process mining is to discover process models from event logs. However, for processes that are not well structured and have a lot of diverse behavior, existing process m...
Gabriel M. Veiga, Diogo R. Ferreira
WADS
2009
Springer
202views Algorithms» more  WADS 2009»
15 years 10 months ago
Minimal Locked Trees
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties...
Brad Ballinger, David Charlton, Erik D. Demaine, M...
WINE
2009
Springer
184views Economy» more  WINE 2009»
15 years 10 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...
« Prev « First page 1762 / 1969 Last » Next »