Sciweavers

1798 search results - page 65 / 360
» A Tree for All Seasons
Sort
View
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
14 years 3 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...
ISNN
2005
Springer
14 years 2 months ago
Feature Selection and Intrusion Detection Using Hybrid Flexible Neural Tree
Current Intrusion Detection Systems (IDS) examine all data features to detect intrusion or misuse patterns. Some of the features may be redundant or contribute little (if anything)...
Yuehui Chen, Ajith Abraham, Ju Yang
ICPR
2002
IEEE
14 years 1 months ago
Tree Pruning for Output Coded Ensembles
Output Coding is a method of converting a multiclass problem into several binary subproblems and gives an ensemble of binary classifiers. Like other ensemble methods, its perform...
Terry Windeatt, Gholamreza Ardeshir
ISCAS
2002
IEEE
94views Hardware» more  ISCAS 2002»
14 years 1 months ago
Minimum power broadcast trees for wireless networks: optimizing using the viability lemma
Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all no...
Robert J. Marks II, Arindam Kumar Das, Mohamed A. ...
LACL
1998
Springer
14 years 13 days ago
Lambek Calculus Proofs and Tree Automata
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
Hans-Jörg Tiede