Sciweavers

2292 search results - page 203 / 459
» Hierarchical approximation and localization
Sort
View
COMPGEOM
2005
ACM
15 years 8 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
CG
2006
Springer
15 years 6 months ago
Shape reasoning and understanding
s: clustering, denoising, sharp feature, shape abstraction, reverse engineering In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fit...
Bianca Falcidieno, Remco C. Veltkamp
TIP
2008
128views more  TIP 2008»
15 years 6 months ago
Wavelet Frame Accelerated Reduced Support Vector Machines
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
Matthias Rätsch, Gerd Teschke, Sami Romdhani,...
TMC
2011
203views more  TMC 2011»
15 years 1 months ago
Throughput Optimization in Mobile Backbone Networks
—This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which hav...
Emily M. Craparo, Jonathan P. How, Eytan Modiano
CVPR
2012
IEEE
13 years 9 months ago
Scalable k-NN graph construction for visual descriptors
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...
Jing Wang, Jingdong Wang, Gang Zeng, Zhuowen Tu, R...