Sciweavers

976 search results - page 147 / 196
» The Complexity of Timetable Construction Problems
Sort
View
SOFTCO
2004
Springer
14 years 2 months ago
Designing Neural Networks Using Gene Expression Programming
Abstract. An artificial neural network with all its elements is a rather complex structure, not easily constructed and/or trained to perform a particular task. Consequently, severa...
Cândida Ferreira
SMA
2003
ACM
118views Solid Modeling» more  SMA 2003»
14 years 2 months ago
Graph based topological analysis of tessellated surfaces
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
Tula Ram Ban, Dibakar Sen
COCO
2003
Springer
145views Algorithms» more  COCO 2003»
14 years 2 months ago
Hardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
Emanuele Viola
CRYPTO
2003
Springer
87views Cryptology» more  CRYPTO 2003»
14 years 2 months ago
Private Circuits: Securing Hardware against Probing Attacks
Can you guarantee secrecy even if an adversary can eavesdrop on your brain? We consider the problem of protecting privacy in circuits, when faced with an adversary that can access ...
Yuval Ishai, Amit Sahai, David Wagner
SAC
2010
ACM
14 years 2 months ago
An algorithm to generate the context-sensitive synchronized control flow graph
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
Marisa Llorens, Javier Oliver, Josep Silva, Salvad...