Sciweavers

5084 search results - page 339 / 1017
» Proving Possibility Properties
Sort
View
FAW
2007
Springer
115views Algorithms» more  FAW 2007»
16 years 26 days ago
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...
Stavros D. Nikolopoulos, Leonidas Palios
FCT
2007
Springer
16 years 26 days ago
A String-Based Model for Simple Gene Assembly
Abstract. The simple intramolecular model for gene assembly in ciliates is particularly interesting because it can predict the correct assembly of all available experimental data, ...
Robert Brijder, Miika Langille, Ion Petre
FUN
2007
Springer
78views Algorithms» more  FUN 2007»
16 years 26 days ago
Wooden Geometric Puzzles: Design and Hardness Proofs
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
Helmut Alt, Hans L. Bodlaender, Marc J. van Krevel...
ICANN
2007
Springer
16 years 26 days ago
Multi-dimensional Recurrent Neural Networks
Abstract. Recurrent neural networks (RNNs) have proved effective at one dimensional sequence learning tasks, such as speech and online handwriting recognition. Some of the properti...
Alex Graves, Santiago Fernández, Jürge...
ICICS
2007
Springer
16 years 26 days ago
A Framework for Game-Based Security Proofs
Abstract. To be accepted, a cryptographic scheme must come with a proof that it satisfies some standard security properties. However, because cryptographic schemes are based on no...
David Nowak