Sciweavers

4137 search results - page 215 / 828
» On the number of matchings of a tree
Sort
View
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 8 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
IWANN
2009
Springer
16 years 1 months ago
Self Organized Dynamic Tree Neural Network
Cluster analysis is a technique used in a variety of fields. There are currently various algorithms used for grouping elements that are based on different methods including partiti...
Juan Francisco de Paz, Sara Rodríguez, Javi...
DIS
2003
Springer
15 years 12 months ago
Prediction of Molecular Bioactivity for Drug Design Using a Decision Tree Algorithm
Abstract. A machine learning-based approach to the prediction of molecular bioactivity in new drugs is proposed. Two important aspects are considered for the task: feature subset s...
Sanghoon Lee, Jihoon Yang, Kyung-Whan Oh
ICALP
1999
Springer
15 years 11 months ago
On the Complements of Partial k-Trees
We introduce new techniques for studying the structure of partial k-trees. In particular, we show that the complements of partial k-trees provide an intuitively-appealing character...
Arvind Gupta, Damon Kaller, Thomas C. Shermer
CSL
2010
Springer
15 years 7 months ago
Graded Computation Tree Logic with Binary Coding
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
Alessandro Bianco, Fabio Mogavero, Aniello Murano