16430 search results - page 377 / 3286 » On Computable Tree Functions |
144
Voted
ICPR
2010
IEEE
16 years 1 months ago
2010
IEEE
In this paper, we present a fast and accurate approximation of the Euclidean opening function which is a wide-used tool in morphological mathematics to analyze binary shapes since...
138
click to vote
ICTAC
2007
Springer
16 years 12 days ago
2007
Springer
Abstract. Differing from [6] this paper reduces non-linear ranking function discovering for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the...
135
click to vote
ICISC
2007
15 years 7 months ago
2007
A simple method for constructing collisions for Shpilrain’s polynomial-based hash function from ICISC 2006 is presented. The attack relies on elementary linear algebra and can be...
176
click to vote
FIMH
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. Over the past several decades, the mouse has gained prominence in the cardiac electrophysiology literature as the animal model of choice. Using computer models of the mou...
160
click to vote
GAMEON
2003
15 years 7 months ago
2003
This work presents the chosen approach for the prototyping of an Artificial Intelligence Engine designed to provide support for the implementation of AI functionalities in compute...