Sciweavers

4486 search results - page 555 / 898
» Adaptable Boundary Sets
Sort
View
AIMS
2007
Springer
16 years 1 months ago
Modeling Change Without Breaking Promises
Promise theory defines a method by which static service bindings are made in a network, but little work has been done on handling the dynamic case in which bindings must change ov...
Alva L. Couch, Hengky Susanto, Marc Chiarini
BIOWIRE
2007
Springer
16 years 1 months ago
Evolutionary and Temporal Dynamics of Transcriptional Regulatory Networks
Transcriptional regulation is a key mechanism that allows cells to make the appropriate amount of proteins at the right time. This is mediated by transcription factors that respond...
M. Madan Babu
CAI
2007
Springer
16 years 1 months ago
Learning Deterministically Recognizable Tree Series - Revisited
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
Andreas Maletti
CRYPTO
2007
Springer
116views Cryptology» more  CRYPTO 2007»
16 years 1 months ago
Random Oracles and Auxiliary Input
We introduce a variant of the random oracle model where oracle-dependent auxiliary input is allowed. In this setting, the adversary gets an auxiliary input that can contain informa...
Dominique Unruh
ECTEL
2007
Springer
16 years 1 months ago
Community Tools for Repurposing Learning Objects
A critical success factor for the reuse of learning objects is the ease by which they may be repurposed in order to enable reusability in a different teaching context from which th...
Chu Wang, Kate Dickens, Hugh C. Davis, Gary Wills