Sciweavers

ALENEX
2016
81views Algorithms» more  ALENEX 2016»
8 years 8 months ago
Geometry Helps to Compare Persistence Diagrams
Exploiting geometric structure to improve the asymptotic complexity of discrete assignment problems is a well-studied subject. In contrast, the practical advantages of using geome...
Michael Kerber, Dmitriy Morozov, Arnur Nigmetov
AAECC
2016
Springer
89views Algorithms» more  AAECC 2016»
8 years 8 months ago
Attribute-based versions of Schnorr and ElGamal
We design in this paper the first attribute-based cryptosystems that work in the classical Discrete Logarithm, pairing-free, setting. The attribute-based signature scheme can be s...
Javier Herranz
AAI
2015
9views Algorithms» more  AAI 2015»
8 years 8 months ago
Generation and Characterization of Fuzzy T-preorders
This paper studies T-preorders than can be generated in a natural way by a single fuzzy subset. These T-preorders are called one-dimensional and are of great importance, since ever...
Dionís Boixader, Jordi Recasens
AAI
2015
13views Algorithms» more  AAI 2015»
8 years 8 months ago
Music Emotion Recognition with Standard and Melodic Audio Features
We propose a novel approach to music emotion recognition by combining standard and melodic features extracted directly from audio. To this end, a new audio dataset organized simil...
Renato Panda, Bruno Rocha, Rui Pedro Paiva
AAECC
2015
Springer
23views Algorithms» more  AAECC 2015»
8 years 8 months ago
Computing fundamental groups from point clouds
We describe an algorithm for computing a finite, and typically small, presentation of the fundamental group of a finite regular CW-space. The algorithm is based on the constructi...
Piotr Brendel, Pawel Dlotko, Graham Ellis, Mateusz...
AAECC
2015
Springer
4views Algorithms» more  AAECC 2015»
8 years 8 months ago
Quasi-stable ideals and Borel-fixed ideals with a given Hilbert polynomial
The present paper investigates properties of quasi stable ideals and of Borel-fixed ideals in a polynomial ring k[x0, . . . , xn], in order to design two algorithms: the first on...
Cristina Bertone
AAECC
2015
Springer
7views Algorithms» more  AAECC 2015»
8 years 8 months ago
The Rabin cryptosystem revisited
The Rabin scheme used in public-key cryptosystem is here revisited with a focus limited to a few specific open issues. In particular, message decryption requires one out of four ...
Michele Elia, Matteo Piva, Davide Schipani
CIAC
2013
Springer
38views Algorithms» more  CIAC 2013»
8 years 8 months ago
Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost
In network activation problems we are given a directed or undirected graph G = (V, E) with a family {fuv (xu, xv) : (u, v) ∈ E} of monotone non-decreasing activation functions fr...
Hasna Mohsen Alqahtani, Thomas Erlebach
TACAS
2014
Springer
18views Algorithms» more  TACAS 2014»
8 years 8 months ago
Variations on Safety
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region, in which nothing “bad” happens. Equival...
Orna Kupferman