Sciweavers

16430 search results - page 358 / 3286
» On Computable Tree Functions
Sort
View
SAC
2006
ACM
15 years 11 months ago
Induction of compact decision trees for personalized recommendation
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
Daniel Nikovski, Veselin Kulev
DSVIS
2005
Springer
15 years 10 months ago
Mapping ConcurTaskTrees into UML 2.0
Abstract. The ConcurTaskTrees (CTT) is one of the most widely used notations for task modeling, specifically tailored for user interface model-based design. The integration of CTT ...
Leonel Nóbrega, Nuno Jardim Nunes, Helder C...
IPTPS
2005
Springer
15 years 10 months ago
Chainsaw: Eliminating Trees from Overlay Multicast
In this paper, we present Chainsaw, a p2p overlay multicast system that completely eliminates trees. Peers are notified of new packets by their neighbors and must explicitly requ...
Vinay S. Pai, Kapil Kumar, Karthik Tamilmani, Vina...
PPSN
2004
Springer
15 years 10 months ago
Learning Probabilistic Tree Grammars for Genetic Programming
Genetic Programming (GP) provides evolutionary methods for problems with tree representations. A recent development in Genetic Algorithms (GAs) has led to principled algorithms cal...
Peter A. N. Bosman, Edwin D. de Jong
WG
2004
Springer
15 years 10 months ago
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
Mordecai J. Golin, Yiu-Cho Leung