Sciweavers

589 search results - page 14 / 118
» Matching Concavity Trees
Sort
View
ICIP
2006
IEEE
14 years 9 months ago
Tree-Based Orthogonal Matching Pursuit Algorithm for Signal Reconstruction
Recent studies in linear inverse problems have recognized the sparse representation of unknown signal in a certain basis as an useful and effective prior information to solve thos...
Chinh La, Minh N. Do
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
13 years 5 months ago
Improved appearance-based matching in similar and dynamic environments using a Vocabulary tree
Abstract— In this paper we present a topological map building algorithm based on a Vocabulary Tree that is robust to features present in dynamic or similar environments. The algo...
Deon George Sabatta, Davide Scaramuzza, Roland Sie...
DCC
2009
IEEE
14 years 2 months ago
Tree Histogram Coding for Mobile Image Matching
For mobile image matching applications, a mobile device captures a query image, extracts descriptive features, and transmits these features wirelessly to a server. The server reco...
David M. Chen, Sam S. Tsai, Vijay Chandrasekhar, G...
WWW
2010
ACM
14 years 2 months ago
The paths more taken: matching DOM trees to search logs for accurate webpage clustering
An unsupervised clustering of the webpages on a website is a primary requirement for most wrapper induction and automated data extraction methods. Since page content can vary dras...
Deepayan Chakrabarti, Rupesh R. Mehta
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 8 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...