Sciweavers

4137 search results - page 241 / 828
» On the number of matchings of a tree
Sort
View
IGARSS
2010
15 years 4 months ago
New hyperspectral data representation using binary partition tree
The optimal exploitation of the information provided by hyperspectral images requires the development of advanced image processing tools. This paper introduces a new hierarchical ...
Silvia Valero, Philippe Salembier, Jocelyn Chanuss...
ALGORITHMICA
2011
15 years 1 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
KESAMSTA
2011
Springer
14 years 9 months ago
Extending the JADE Agent Behaviour Model with JBehaviourTrees Framework
Creating modular behaviours in JADE using a traditional method such as the FSM (Finite State Machine) can be a difficult task to achieve. The first issue with FSMs is that they do...
Iva Bojic, Tomislav Lipic, Mario Kusek, Gordan Jez...
TON
2002
144views more  TON 2002»
15 years 6 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
IPL
2002
59views more  IPL 2002»
15 years 6 months ago
An efficient decoding technique for Huffman codes
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular...
Rezaul Alam Chowdhury, M. Kaykobad, Irwin King