Sciweavers

5326 search results - page 737 / 1066
» On what we can ensure
Sort
View
RECOMB
2010
Springer
15 years 11 months ago
SubMAP: Aligning Metabolic Pathways with Subnetwork Mappings
Abstract. We consider the problem of aligning two metabolic pathways. Unlike traditional approaches, we do not restrict the alignment to one-to-one mappings between the molecules o...
Ferhat Ay, Tamer Kahveci
ICALP
2009
Springer
16 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
CRYPTO
2009
Springer
145views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
ECRTS
2005
IEEE
16 years 10 days ago
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...
James H. Anderson, Vasile Bud, UmaMaheswari C. Dev...
ATAL
2006
Springer
15 years 10 months ago
MDPOP: faithful distributed implementation of efficient social choice problems
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
Adrian Petcu, Boi Faltings, David C. Parkes