Sciweavers

1058 search results - page 51 / 212
» It's Doomed; We Can Prove It
Sort
View
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
12 years 11 days ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
AML
2011
204views Mathematics» more  AML 2011»
13 years 5 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
PDP
2008
IEEE
14 years 4 months ago
Type Safe Algorithmic Skeletons
This paper addresses the issue of type safe algorithmic skeletons. From a theoretical perspective we contribute by: formally specifying a type system for algorithmic skeletons, an...
Denis Caromel, Ludovic Henrio, Mario Leyton
IDEAL
2005
Springer
14 years 3 months ago
Neural Networks: A Replacement for Gaussian Processes?
Abstract. Gaussian processes have been favourably compared to backpropagation neural networks as a tool for regression. We show that a recurrent neural network can implement exact ...
Matthew Lilley, Marcus R. Frean
FSE
2005
Springer
117views Cryptology» more  FSE 2005»
14 years 3 months ago
Security Analysis of a 2/3-Rate Double Length Compression Function in the Black-Box Model
Abstract. In this paper, we propose a 2/3-rate double length compression function and study its security in the black-box model. We prove that to get a collision attack for the com...
Mridul Nandi, Wonil Lee, Kouichi Sakurai, Sangjin ...