Sciweavers

19866 search results - page 318 / 3974
» Computing all factorizations in ***
Sort
View
MEMBRANE
2009
Springer
16 years 1 months ago
Computational Nature of Processes Induced by Biochemical Reactions
evel of abstraction that we adopt, the functioning of a biochemical reaction is based on facilitation and inhibition: a reaction can take place if all of its reactants are present ...
Andrzej Ehrenfeucht, Grzegorz Rozenberg
INFORMATICALT
2008
123views more  INFORMATICALT 2008»
15 years 6 months ago
A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities
Abstract. A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle `The part i...
Yaroslav D. Sergeyev
TCS
2008
15 years 6 months ago
The computational complexity of the parallel knock-out problem
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
Hajo Broersma, Matthew Johnson 0002, Daniël P...
CRYPTO
2012
Springer
262views Cryptology» more  CRYPTO 2012»
13 years 9 months ago
Functional Encryption with Bounded Collusions via Multi-party Computation
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
ALGOSENSORS
2004
Springer
16 years 4 days ago
On the Computational Complexity of Sensor Network Localization
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
James Aspnes, David Kiyoshi Goldenberg, Yang Richa...