Sciweavers

753 search results - page 111 / 151
» Fragments-based Model Reduction: Some Case Studies
Sort
View
EUROCRYPT
1998
Springer
13 years 12 months ago
Strengthened Security for Blind Signatures
Abstract. Provable security is a very nice property for cryptographic protocols. Unfortunately, in many cases, this is at the cost of a considerable loss in terms of efficiency. Mo...
David Pointcheval
ICSM
1995
IEEE
13 years 11 months ago
Iterative reengineering to compensate for quick-fix maintenance
A typical approach to software maintenance is analyzing just the source code, applying some patches, releasing the new version, and then updating the documentation. This quick-fix...
Filippo Lanubile, Giuseppe Visaggio
RSA
2008
87views more  RSA 2008»
13 years 7 months ago
A combinatorial approach to jumping particles: The parallel TASEP
In this paper we continue the combinatorial study of models of particles jumping on a row of cells which we initiated with the standard totally asymmetric exclusion process or TASE...
Enrica Duchi, Gilles Schaeffer
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
14 years 5 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
SEKE
2009
Springer
14 years 2 months ago
Bridging Semantic Gaps Between Stakeholders in the Production Automation Domain with Ontology Areas
Abstract—Stakeholders from several domains with local terminologies have to work together to develop and operate softwareintensive systems, like production automation systems. On...
Stefan Biffl, Wikan Danar Sunindyo, Thomas Moser