Sciweavers

2492 search results - page 98 / 499
» On the General Signature Trees
Sort
View
CVPR
2011
IEEE
13 years 6 months ago
Scale and Rotation Invariant Matching Using Linearly Augmented Trees
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
Hao Jiang, Tai-Peng Tian, Stan Sclaroff
NHM
2010
100views more  NHM 2010»
13 years 4 months ago
A 2-adic approach of the human respiratory tree
We propose here a general framework to address the question of trace operators on a dyadic tree. This work is motivated by the modeling of the human bronchial tree which, thanks t...
Frédéric Bernicot, Bertrand Maury, D...
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 11 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 7 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
DISOPT
2011
240views Education» more  DISOPT 2011»
13 years 5 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...