Sciweavers

TACAS
2007
Springer
117views Algorithms» more  TACAS 2007»
15 years 10 months ago
Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning
This paper is concerned with bridging the gap between requirements, provided as a set of scenarios, and conforming design models. The novel aspect of our approach is to exploit lea...
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern...
TACAS
2007
Springer
126views Algorithms» more  TACAS 2007»
15 years 10 months ago
Kodkod: A Relational Model Finder
Emina Torlak, Daniel Jackson
PDCAT
2007
Springer
15 years 10 months ago
Two Tree-Based Algorithms for Network Spare Capacity Design
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan...
PAIRING
2007
Springer
15 years 10 months ago
Remarks on Cheon's Algorithms for Pairing-Related Problems
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
Shunji Kozaki, Taketeru Kutsuma, Kazuto Matsuo
MLG
2007
Springer
15 years 10 months ago
Improving Frequent Subgraph Mining in the Presence of Symmetry
While recent algorithms for mining the frequent subgraphs of a database are efficient in the general case, these algorithms tend to do poorly on databases that have a few or no la...
Christian Desrosiers, Philippe Galinier, Pierre Ha...
ISSAC
2007
Springer
105views Mathematics» more  ISSAC 2007»
15 years 10 months ago
Certification of the QR factor R and of lattice basis reducedness
Given a lattice basis of n vectors in Zn, we propose an algorithm using 12n3 + O(n2) floating point operations for checking whether the basis is LLL-reduced. If the basis is redu...
Gilles Villard
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
15 years 10 months ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann
157
Voted
ISNN
2007
Springer
15 years 10 months ago
Regularized Alternating Least Squares Algorithms for Non-negative Matrix/Tensor Factorization
Nonnegative Matrix and Tensor Factorization (NMF/NTF) and Sparse Component Analysis (SCA) have already found many potential applications, especially in multi-way Blind Source Separ...
Andrzej Cichocki, Rafal Zdunek
ISI
2007
Springer
15 years 10 months ago
Using Digital Chains of Custody on Constrained Devices to Verify Evidence
—A digital chain of custody is an account documenting digital data at a particular place and time. This paper gives a method of validating and authenticating a digital chain of c...
Phillip G. Bradford, Daniel A. Ray
ISBRA
2007
Springer
15 years 10 months ago
Clustering Algorithms Optimizer: A Framework for Large Datasets
Clustering algorithms are employed in many bioinformatics tasks, including categorization of protein sequences and analysis of gene-expression data. Although these algorithms are r...
Roy Varshavsky, David Horn, Michal Linial