Sciweavers

1664 search results - page 202 / 333
» Distance labeling in graphs
Sort
View
TKDE
2011
362views more  TKDE 2011»
15 years 1 months ago
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
Luh Yen, Marco Saerens, François Fouss
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
16 years 7 months ago
Unordered Tree Mining with Applications to Phylogeny
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
Dennis Shasha, Jason Tsong-Li Wang, Sen Zhang
LATA
2009
Springer
16 years 1 months ago
From Gene Trees to Species Trees through a Supertree Approach
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
CP
2003
Springer
15 years 11 months ago
Comparison of Symmetry Breaking Methods
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Karen E. Petrie
VLDB
1999
ACM
134views Database» more  VLDB 1999»
15 years 10 months ago
Capturing and Querying Multiple Aspects of Semistructured Data
Motivated to a large extent by the substantial and growing prominence of the World-Wide Web and the potential benefits that may be obtained by applying database concepts and tech...
Curtis E. Dyreson, Michael H. Böhlen, Christi...