Sciweavers

903 search results - page 58 / 181
» Non-well-founded trees in categories
Sort
View
SENSYS
2003
ACM
15 years 11 months ago
Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks
Data dissemination from sources to sinks is one of the main functions in sensor networks. In this paper, we propose SEAD, a Scalable Energy-efficient Asynchronous Dissemination pr...
Hyung Seok Kim, Tarek F. Abdelzaher, Wook Hyun Kwo...
CIKM
2003
Springer
15 years 11 months ago
Hierarchical graph indexing
Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs w...
James Abello, Yannis Kotidis
POPL
2010
ACM
16 years 3 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
SAC
2009
ACM
16 years 29 days ago
LEGAL-tree: a lexicographic multi-objective genetic algorithm for decision tree induction
Decision trees are widely disseminated as an effective solution for classification tasks. Decision tree induction algorithms have some limitations though, due to the typical strat...
Márcio P. Basgalupp, Rodrigo C. Barros, And...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 9 days ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith