Sciweavers

855 search results - page 54 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
BMCBI
2010
91views more  BMCBI 2010»
14 years 10 months ago
Ranked retrieval of Computational Biology models
Background: The study of biological systems demands computational support. If targeting a biological problem, the reuse of existing computational models can save time and effort. ...
Ron Henkel, Lukas Endler, Andre Peters, Nicolas Le...
70
Voted
CEC
2005
IEEE
15 years 3 months ago
Evolving swarms that build 3D structures
The complex interactions of natural swarms, for example formed by some social insects, are difficult to comprehend. Considering tasks such as nestbuilding, the necessary underlyin...
Sebastian von Mammen, Christian Jacob, Gabriella K...
CAV
2007
Springer
122views Hardware» more  CAV 2007»
15 years 1 months ago
Parameterized Verification of Infinite-State Processes with Global Conditions
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
JMLR
2010
143views more  JMLR 2010»
14 years 4 months ago
Incremental Sigmoid Belief Networks for Grammar Learning
We propose a class of Bayesian networks appropriate for structured prediction problems where the Bayesian network's model structure is a function of the predicted output stru...
James Henderson, Ivan Titov
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
13 years 9 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...