Sciweavers

616 search results - page 73 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
CORR
1998
Springer
87views Education» more  CORR 1998»
15 years 6 months ago
Word Clustering and Disambiguation Based on Co-occurrence Data
We address the problem of clustering words (or constructing a thesaurus) based on co-occurrence data, and using the acquired word classes to improve the accuracy of syntactic disa...
Hang Li, Naoki Abe
WWW
2006
ACM
16 years 7 months ago
GoGetIt!: a tool for generating structure-driven web crawlers
We present GoGetIt!, a tool for generating structure-driven crawlers that requires a minimum effort from the users. The tool takes as input a sample page and an entry point to a W...
Altigran Soares da Silva, Edleno Silva de Moura, J...
ICRA
2008
IEEE
191views Robotics» more  ICRA 2008»
16 years 29 days ago
Combining automated on-line segmentation and incremental clustering for whole body motions
Abstract— This paper describes a novel approach for incremental learning of human motion pattern primitives through on-line observation of human motion. The observed motion time ...
Dana Kulic, Wataru Takano, Yoshihiko Nakamura
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
16 years 1 months ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....
NBIS
2007
Springer
16 years 20 days ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero