Sciweavers

1064 search results - page 159 / 213
» Single Tree Grammars
Sort
View
122
Voted
IJDMMM
2008
72views more  IJDMMM 2008»
15 years 3 months ago
Mining event histories: a social science perspective
We explore how recent data-mining-based tools developed in domains such as biomedicine or text-mining for extracting interesting knowledge from sequence data could be applied to pe...
Gilbert Ritschard, Alexis Gabadinho, Nicolas S. M&...
135
Voted
PR
2008
93views more  PR 2008»
15 years 3 months ago
Genetic algorithm-based feature set partitioning for classification problems
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...
Lior Rokach
SIAMCOMP
2008
78views more  SIAMCOMP 2008»
15 years 3 months ago
I/O-Efficient Planar Separators
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
Anil Maheshwari, Norbert Zeh
112
Voted
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
15 years 3 months ago
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...
WALCOM
2010
IEEE
351views Algorithms» more  WALCOM 2010»
15 years 1 months ago
Pathwidth and Searching in Parameterized Threshold Graphs
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shas...