Sciweavers

1174 search results - page 13 / 235
» Functional Trees
Sort
View
IWOCA
2009
Springer
123views Algorithms» more  IWOCA 2009»
14 years 3 months ago
Computability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
Petr Skoda
AHSWN
2008
92views more  AHSWN 2008»
13 years 8 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
FCS
2006
13 years 10 months ago
Principles of Optimal Probabilistic Decision Tree Construction
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina,...
FLOPS
2004
Springer
14 years 2 months ago
DDT: a Declarative Debugging Tool for Functional-Logic Languages
We present a graphical tool for the declarative debugging of wrong answers in functional-logic languages. The tool, integrated in the system T OY, can be used to navigate a computa...
Rafael Caballero, Mario Rodríguez-Artalejo
CVGIP
2004
98views more  CVGIP 2004»
13 years 8 months ago
Topological volume skeletonization and its application to transfer function design
Topological volume skeletonization is a novel approach for automating transfer function design in visualization by extracting the topological structure of a volume dataset. The sk...
Shigeo Takahashi, Yuriko Takeshima, Issei Fujishir...