Sciweavers

1284 search results - page 119 / 257
» Data Structures for Mergeable Trees
Sort
View
IPSN
2005
Springer
14 years 1 months ago
Lossy network correlated data gathering with high-resolution coding
— We consider a sensor network measuring correlated data, where the task is to gather all data from the network nodes to a sink. We consider the case where data at nodes is lossy...
Razvan Cristescu, Baltasar Beferull-Lozano
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
13 years 12 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
ICDM
2008
IEEE
136views Data Mining» more  ICDM 2008»
14 years 2 months ago
Generalized Framework for Syntax-Based Relation Mining
Supervised approaches to Data Mining are particularly appealing as they allow for the extraction of complex relations from data objects. In order to facilitate their application i...
Bonaventura Coppola, Alessandro Moschitti, Daniele...
JDWM
2007
107views more  JDWM 2007»
13 years 7 months ago
Evolutionary Induction of Mixed Decision Trees
This article presents a new evolutionary algorithm (EA) for induction of mixed decision trees. In nonterminal nodes of a mixed tree, different types of tests can be placed, rangin...
Marek Kretowski, Marek Grzes
IJON
2006
146views more  IJON 2006»
13 years 7 months ago
Feature selection and classification using flexible neural tree
The purpose of this research is to develop effective machine learning or data mining techniques based on flexible neural tree FNT. Based on the pre-defined instruction/operator se...
Yuehui Chen, Ajith Abraham, Bo Yang