Sciweavers

2409 search results - page 121 / 482
» Building Components from Functions
Sort
View
CSFW
2008
IEEE
14 years 5 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
ITC
2003
IEEE
151views Hardware» more  ITC 2003»
14 years 4 months ago
Fault Collapsing via Functional Dominance
A fault fj is said to dominate another fault fi if all tests for fi detect fj . When two faults dominate each other, they are called equivalent. Dominance and equivalence relation...
Vishwani D. Agrawal, A. V. S. S. Prasad, Madhusuda...
TSC
2010
133views more  TSC 2010»
13 years 9 months ago
Semantic-Based Mashup of Composite Applications
—The need for integration of all types of client and server applications that were not initially designed to interoperate is gaining popularity. One of the reasons for this popul...
Anne H. H. Ngu, Michael Pierre Carlson, Quan Z. Sh...
ECSA
2010
Springer
13 years 12 months ago
Software Architecture Constraints as Customizable, Reusable and Composable Entities
One of the major advantages of component-based software engineering is the ability for developers to reuse and assemble software entities to build complex software. Whereas decompo...
Chouki Tibermacine, Christophe Dony, Salah Sadou, ...
IEEEMSP
2002
IEEE
110views Multimedia» more  IEEEMSP 2002»
14 years 3 months ago
Summarizing video using non-negative similarity matrix factorization
Abstract— We present a novel approach to automatically extracting summary excerpts from audio and video. Our approach is to maximize the average similarity between the excerpt an...
Matthew L. Cooper, Jonathan Foote