Sciweavers

1247 search results - page 110 / 250
» A Generalization of Jumps and Labels
Sort
View
ENTCS
2010
90views more  ENTCS 2010»
13 years 10 months ago
Recursive Program Schemes and Context-Free Monads
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
Jirí Adámek, Stefan Milius, Jiri Vel...
ACTA
2000
104views more  ACTA 2000»
13 years 10 months ago
Some results on the Collatz problem
The paper refers to the Collatz's conjecture. In the first part, we present some equivalent forms of this conjecture and a slight generalization of a former result from [1]. T...
Stefan Andrei, Manfred Kudlek, Radu Stefan Nicules...
CTW
2002
74views more  CTW 2002»
13 years 10 months ago
Nine Steps to Move Forward from Error
: Following celebrated failures stakeholders begin to ask questions about how to improve the systems and processes they operate, manage or depend on. In this process it is easy to ...
David D. Woods, Richard I. Cook
CVPR
2012
IEEE
12 years 1 months ago
Discriminately decreasing discriminability with learned image filters
In machine learning and computer vision, input signals are often filtered to increase data discriminability. For example, preprocessing face images with Gabor band-pass filters ...
Jacob Whitehill, Javier R. Movellan
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
14 years 11 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...