I recently reviewed a thesis project wherein the student used recursion to minimize a function. The student used number of … More
Month: September 2007
IPAM Workshop: Cyber-enabled Discovery & Information
Dr. Mark Green, from IPAM at UCLA, sent me this Call for Workshop: Dear colleagues, I am writing to let you … More
A Novel Perspective of Similarity
The problem with so many definitions of similarity measures is that each of them is defined for a particular knowledge … More
Binary Similarity Calculator
In my previous post I mentioned the Hamming Distance. I was thinking in adding to my Levenshtein Edit Distance calculator the … More
Hamming Distance
After uploading the Levenshtein Edit Distance tool, several readers asked if I could incorporate a version to account for the … More
Being Referenced Without Being Referenced
I have the honor of being “referenced” by Lau Patrick from ETH’s Databases and Information Systems Group in the manuscript … More
Random Notes and LauraMansfield
These are some late random notes. Sorry for the delay. 1. I am putting together a research project for a … More
European Conference on Digital Libraries (ECDL 2007)
The Computer and Automation Research Institute of the Hungarian Academy of Sciences (MTA SZTAKI) cordially invites you to participate in … More
Brute Force Algorithm
The brute force algorithm (BF) consists in evaluating a text stream and determining at all positions between 0 and n-m, … More
Metric Clusters 2
Yesterday I provided a basic explanation of metric weights and metric clusters. This time I want to expand on this … More
You must be logged in to post a comment.