K-tree 0.1 (Default branch)


 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements Software Releases - RSS News K-tree 0.1 (Default branch)
# 1  
Old 12-11-2008
K-tree 0.1 (Default branch)

K-tree provides a scalable approach to clustering by combining the B+-tree and k-means algorithms. Clustering can be used to solve problems in signal processing, machine learning, and other contexts. It has recently been used at INEX 2008 to solve document clustering problems on the Wikipedia corpus. Image

Image

More...
Login or Register to Ask a Question

Previous Thread | Next Thread
Login or Register to Ask a Question
Blt_TreeReleaseToken(3) 				      BLT Library Procedures					   Blt_TreeReleaseToken(3)

__________________________________________________________________________________________________________________________________________________

NAME
Blt_TreeReleaseToken - Releases token associated with tree object. SYNOPSIS
#include <bltTree.h> int Blt_TreeReleaseToken(token) ARGUMENTS
Blt_Tree *token (in) Token of tree to be released. _________________________________________________________________ DESCRIPTION
This procedure releases the token associated with a C-based tree data object. When all outstanding tokens for a tree data object have been released, then the data object itself will be freed. The arguments are as follows: token Token of the tree data object to be released. This token was initialized either by Tcl_TreeGetToken or Blt_TreeCreate earlier. RETURNS
Nothing. EXAMPLE
The following example creates and then releases a new token. Blt_Tree token; if (Blt_TreeCreate(interp, "myTree", &token) != TCL_OK) { return TCL_ERROR; } printf("tree is %s ", Blt_TreeName(token)); /* Tree will be destroyed when the token is released. */ Blt_TreeReleaseToken(token); KEYWORDS
tree, token BLT
2.4 Blt_TreeReleaseToken(3)