Sciweavers

381 search results - page 35 / 77
» Fast Neighbor Joining
Sort
View
JMLR
2010
111views more  JMLR 2010»
14 years 4 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
3DPVT
2002
IEEE
219views Visualization» more  3DPVT 2002»
15 years 2 months ago
A Multi-Resolution Scheme ICP Algorithm for Fast Shape Registration
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
Timothée Jost, Heinz Hügli
ECUMN
2004
Springer
15 years 1 months ago
Fast Handoff Algorithm Using Access Points with Dual RF Modules
With the spread of portable computers, mobile users rapidly increase and have growing interests in wireless LAN (WLAN). However, when a mobile node (MN) moves, handoff can frequent...
Chun-Su Park, Hye-Soo Kim, Sang-Hee Park, Kyunghun...
CVPR
2007
IEEE
15 years 12 months ago
Fast Human Pose Estimation using Appearance and Motion via Multi-Dimensional Boosting Regression
We address the problem of estimating human pose in video sequences, where rough location has been determined. We exploit both appearance and motion information by defining suitabl...
Alessandro Bissacco, Ming-Hsuan Yang, Stefano Soat...
ICCV
2007
IEEE
15 years 12 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas