Sciweavers

3897 search results - page 222 / 780
» complexity 2010
Sort
View
ECCC
2000
113views more  ECCC 2000»
15 years 6 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich
ENTCS
2002
78views more  ENTCS 2002»
15 years 6 months ago
Slicing Synchronous Reactive Programs
This paper extends the well-known technique of slicing to synchronous reactive programs. Synchronous languages exemplified by Esterel, Lustre, Signal and Argos, novel model of exe...
Vinod Ganapathy, S. Ramesh
ENTCS
2007
139views more  ENTCS 2007»
15 years 6 months ago
A Change-based Approach to Software Evolution
Software evolution research is limited by the amount of information available to researchers: Current version control tools do not store all the information generated by developer...
Romain Robbes, Michele Lanza
EUROMED
2010
15 years 4 months ago
Architectural Heritage Online: Ontology-Driven Website Generation for World Heritage Sites in Danger
We introduce an online knowledge base for semantic representation and annotation of a world heritage site in danger. For this purpose we designed ontology inside the protégé tool...
Elham Andaroodi, Asanobu Kitamoto
IFIPTM
2010
204views Management» more  IFIPTM 2010»
15 years 4 months ago
xESB: An Enterprise Service Bus for Access and Usage Control Policy Enforcement
Enforcing complex policies that span organizational domains is an open challenge. Current work on SOA policy enforcement splits security in logical components that can be distribut...
Gabriela Gheorghe, Stephan Neuhaus, Bruno Crispo