We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...
We develop a new framework for the quantitative analysis of shapes of planar curves. Shapes are modeled on elastic strings that can be bent, stretched or compressed at different r...
In this paper, a hybrid medical image segmentation approach is proposed based on a dual front evolution and fast sweeping evolution. This approach is composed of two stages. In th...
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
Here we show that a notion of congruence in statistical structureacross2 0frequency bandsproduces a useful definition of visualpatterns for perceiving target distinctness. In orde...
J. Chamorro, Javier Martinez-Baena, Rosa Rodriguez...