Sciweavers

2009 search results - page 178 / 402
» Dense Interest Points
Sort
View
ACISP
2005
Springer
14 years 3 months ago
On the Possibility of Constructing Meaningful Hash Collisions for Public Keys
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
Arjen K. Lenstra, Benne de Weger
DALT
2005
Springer
14 years 3 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
DSMML
2004
Springer
14 years 3 months ago
Transformations of Gaussian Process Priors
Abstract. Gaussian process prior systems generally consist of noisy measurements of samples of the putatively Gaussian process of interest, where the samples serve to constrain the...
Roderick Murray-Smith, Barak A. Pearlmutter
ICSM
2003
IEEE
14 years 3 months ago
Deriving tolerant grammars from a base-line grammar
A grammar-based approach to tool development in re- and reverse engineering promises precise structure awareness, but it is problematic in two respects. Firstly, it is a considera...
Steven Klusener, Ralf Lämmel
ICTAI
2003
IEEE
14 years 3 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...