Sciweavers

2354 search results - page 273 / 471
» Radio number for trees
Sort
View
SDM
2009
SIAM
130views Data Mining» more  SDM 2009»
16 years 3 months ago
Grammar Mining.
We introduce the problem of grammar mining, where patterns are context-free grammars, as a generalization of a large number of common pattern mining tasks, such as tree, sequence ...
Luc De Raedt, Siegfried Nijssen
ICDM
2006
IEEE
81views Data Mining» more  ICDM 2006»
16 years 23 days ago
Full Perfect Extension Pruning for Frequent Graph Mining
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
Christian Borgelt, Thorsten Meinl
ISCAS
2005
IEEE
159views Hardware» more  ISCAS 2005»
16 years 9 days ago
A Fourier series-based RLC interconnect model for periodic signals
— Based on a Fourier series analysis, an analytic interconnect model is presented which is suitable for periodic signals, such as a clock signal. In this model, the far end time ...
Guoqing Chen, Eby G. Friedman
ISMIR
2005
Springer
132views Music» more  ISMIR 2005»
16 years 6 days ago
VOISE: Learning to Segregate Voices in Explicit and Implicit Polyphony
Finding multiple occurrences of themes and patterns in music can be hampered due to polyphonic textures. This is caused by the complexity of music that weaves multiple independent...
Phillip B. Kirlin, Paul E. Utgoff
GD
2004
Springer
16 years 3 days ago
Simultaneous Embedding of Planar Graphs with Few Bends
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
Cesim Erten, Stephen G. Kobourov