Sciweavers

1376 search results - page 63 / 276
» Searching Trees: An Essay
Sort
View
TIP
2008
219views more  TIP 2008»
14 years 11 months ago
Binary Partition Trees for Object Detection
This paper discusses the use of Binary Partition Trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regio...
Verónica Vilaplana, Ferran Marqués, ...
EOR
2008
107views more  EOR 2008»
14 years 12 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
TCS
2010
14 years 10 months ago
CSP duality and trees of bounded pathwidth
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
Catarina Carvalho, Víctor Dalmau, Andrei A....
ICC
2007
IEEE
15 years 6 months ago
A Low-Complexity Path Metric for Tree-Based Multiple-Antenna Detectors
— Traditional multiple-antenna detectors – which search a tree or a lattice structure – typically apply a metric that requires a preprocessing. Contrary to that, we present a...
Christian Kuhn, Norbert Görtz
DATE
2002
IEEE
91views Hardware» more  DATE 2002»
15 years 4 months ago
An Enhanced Q-Sequence Augmented with Empty-Room-Insertion and Parenthesis Trees
After the discussion on the difference between floorplanning and packing in VLSI placement design, this paper adapts the floorplanner that is based on the Q-sequence to a packin...
Changwen Zhuang, Yoji Kajitani, Keishi Sakanushi, ...