Sciweavers

4137 search results - page 130 / 828
» On the number of matchings of a tree
Sort
View
CCR
2004
153views more  CCR 2004»
15 years 6 months ago
Tree bitmap: hardware/software IP lookups with incremental updates
IP address lookup is challenging for high performance routers because it requires a longest matching prefix at speeds of up to 10 Gbps (OC-192). Existing solutions have poor updat...
Will Eatherton, George Varghese, Zubin Dittia
TIP
2008
195views more  TIP 2008»
15 years 6 months ago
Image Coding Using Dual-Tree Discrete Wavelet Transform
In this paper, we explore the application of 2-D dual-tree discrete wavelet transform (DDWT), which is a directional and redundant transform, for image coding. Three methods for sp...
Jingyu Yang, Yao Wang, Wenli Xu, Qionghai Dai
RAS
2010
142views more  RAS 2010»
15 years 4 months ago
Closing the loop in appearance-guided omnidirectional visual odometry by using vocabulary trees
In this paper, we present a method that allows us to recover the trajectory of a vehicle purely from monocular omnidirectional images very accurately. The method uses a combination...
Davide Scaramuzza, Friedrich Fraundorfer, Marc Pol...
PKDD
2005
Springer
130views Data Mining» more  PKDD 2005»
15 years 12 months ago
Unsupervised Discretization Using Tree-Based Density Estimation
This paper presents an unsupervised discretization method that performs density estimation for univariate data. The subintervals that the discretization produces can be used as the...
Gabi Schmidberger, Eibe Frank
IROS
2009
IEEE
147views Robotics» more  IROS 2009»
16 years 1 months ago
A multi-hypothesis topological SLAM approach for loop closing on edge-ordered graphs
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...
Stephen Tully, George Kantor, Howie Choset, Felix ...