Sciweavers

777 search results - page 51 / 156
» The Refined Process Structure Tree
Sort
View
119
Voted
PAMI
2007
166views more  PAMI 2007»
15 years 3 months ago
A Bayesian, Exemplar-Based Approach to Hierarchical Shape Matching
—This paper presents a novel probabilistic approach to hierarchical, exemplar-based shape matching. No feature correspondence is needed among exemplars, just a suitable pairwise ...
Dariu Gavrila
128
Voted
ICMAS
2000
15 years 5 months ago
Reasoning About Others: Representing and Processing Infinite Belief Hierarchies
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
Sviatoslav Brainov, Tuomas Sandholm
96
Voted
IPL
2002
59views more  IPL 2002»
15 years 3 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
151
Voted
IAJIT
2011
14 years 7 months ago
The chained-cubic tree interconnection network
: The core of a parallel processing system is the interconnection network by which the system’s processors are linked. Due to the great role played by the interconnection network...
Malak Abdullah, Emad Abuelrub, Basel Mahafzah
141
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Occlusion-based depth ordering on monocular images with Binary Partition Tree
This paper proposes a system to relate objects in an image using occlusion cues and arrange them according to depth. The system does not rely on any a priori knowledge of the scen...
Guillem Palou, Philippe Salembier