Sciweavers

138 search results - page 9 / 28
» On some relations between 2-trees and tree metrics
Sort
View
BMCBI
2004
181views more  BMCBI 2004»
13 years 7 months ago
Iterative class discovery and feature selection using Minimal Spanning Trees
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
Sudhir Varma, Richard Simon
PVLDB
2010
252views more  PVLDB 2010»
13 years 2 months ago
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu
LICS
2010
IEEE
13 years 6 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
AAAI
2007
13 years 10 months ago
Relation Extraction from Wikipedia Using Subtree Mining
The exponential growth and reliability of Wikipedia have made it a promising data source for intelligent systems. The first challenge of Wikipedia is to make the encyclopedia mac...
Dat P. T. Nguyen, Yutaka Matsuo, Mitsuru Ishizuka
COMPGEOM
1992
ACM
13 years 11 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar