Sciweavers

3378 search results - page 652 / 676
» A universe of binding and computation
Sort
View
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
14 years 2 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
COMPSAC
2004
IEEE
14 years 2 months ago
Testing Context-Sensitive Middleware-Based Software Applications
Context-sensitive middleware-based software is an emerging kind of ubiquitous computing application. The components of such software communicate proactively among themselves accor...
T. H. Tse, Stephen S. Yau, W. K. Chan, Heng Lu, Ts...
FSE
2004
Springer
125views Cryptology» more  FSE 2004»
14 years 2 months ago
New Security Proofs for the 3GPP Confidentiality and Integrity Algorithms
ded abstract of this paper appears in Fast Software Encryption, FSE 2004, Lecture Notes in Computer Science, W. Meier and B. Roy editors, Springer-Verlag, 2004. This is the full ve...
Tetsu Iwata, Tadayoshi Kohno
ISMDA
2000
Springer
14 years 2 months ago
A System for Monitoring Nosocomial Infections
In this work, we describe a project, jointly started by DEIS University of Bologna and Dianoema S.p.A., in order to build a system which is able to monitor nosocomial infections. T...
Evelina Lamma, M. Manservigi, Paola Mello, Sergio ...
ISMIR
2000
Springer
128views Music» more  ISMIR 2000»
14 years 2 months ago
PROMS: A Web-based Tool for Searching in Polyphonic Music
One major task of a digital music library (DML) is to provide techniques to locate a queried musical pattern in all pieces of music in the database containing that pattern. For a ...
Michael Clausen, R. Engelbrecht, D. Meyer, J. Schm...