Tag Archives: shortest path

Sparksee 5.2 new release!

Posted on June 8, 2015 by Sparsity Technologies

We are proud to announce the release of Sparksee 5.2 today! Download your trial on our website or request a license for free. New version includes the following features: The fastest community detection algorithm: We have included the SCD algorithm … Continue reading →

Posted in News, Sparksee | Tagged , , , , , , | Leave a comment

Query Expansion by Exploiting Graph Properties for Image Retrieval

Posted on June 4, 2015 by Sparsity Technologies

When searching images for a certain query, ambiguity problems may arise. For instance, when searching for the query “colored Volkswagen beetle” the most common search engines would retrieve some images with the famous car, but also the bug and even … Continue reading →

Posted in Research | Tagged , , , , , , , | Leave a comment

How to use DEX algorithm package

Posted on March 26, 2012 by Sparsity Technologies

The latest version of DEX includes the helpful algorithm package that give more high-level operations to the API. Here you can find the list of algorithms explained including examples of use for the Java and .NET APIs: Traversals algorithms To … Continue reading →

Posted in DEX, Documentation | Tagged , , , , , , , , , , , , , , , , , , | 2 Comments

DEX 3.0 features: Graph algorithms

Posted on November 8, 2010 by Sparsity Technologies

Starting today we are going to make a series of posts explaining the most exciting features of the last available version of DEX. We hope that these explanations will give you a hint on the powerful possibilities of DEX. If … Continue reading →

Posted in DEX, Documentation | Tagged , , , , , , , , , , , | 7 Comments