Sciweavers

564 search results - page 99 / 113
» Some Results on the Expressive Power and Complexity of LSCs
Sort
View
AMAST
2004
Springer
15 years 3 months ago
A Science of Software Design
concerns, abstraction (particularly hierarchical abstraction), simplicity, and restricted visibility (locality of information). The overall goal behind these principles was stated ...
Don S. Batory
76
Voted
CSFW
2008
IEEE
15 years 4 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
MIR
2005
ACM
197views Multimedia» more  MIR 2005»
15 years 3 months ago
Enhanced ontologies for video annotation and retrieval
A typical way to perform video annotation requires to classify video elements (e.g. events and objects) according to some pre-defined ontology of the video content domain. Ontolo...
Marco Bertini, Alberto Del Bimbo, Carlo Torniai
PPSN
1994
Springer
15 years 1 months ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
14 years 11 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee