Sciweavers

2487 search results - page 100 / 498
» Partitions of Graphs into Trees
Sort
View
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 3 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
14 years 1 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo
UAI
2008
13 years 11 months ago
Bayesian Out-Trees
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...
Tony Jebara
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
14 years 3 months ago
Distributed Weighted Matching
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Mirjam Wattenhofer, Roger Wattenhofer
ICDAR
2003
IEEE
14 years 2 months ago
Binary Classification Trees for Multi-class Classification Problems
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...
Jin-Seon Lee, Il-Seok Oh