Sciweavers

4536 search results - page 379 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
15 years 4 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
14 years 10 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
MOBIDE
2005
ACM
16 years 12 days ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
3DPVT
2004
IEEE
149views Visualization» more  3DPVT 2004»
15 years 10 months ago
Fan-Meshes: A Geometric Primitive for Point-Based Description of 3D Models and Scenes
We propose a new data structure, called Fan-Meshes (FM), for reconstructing 3D models and scenes represented by dense scanning point clouds. It is a local piecewise linear approxi...
Xiaotian Yan, Fang Meng, Hongbin Zha
ECCV
2006
Springer
16 years 8 months ago
Riemannian Manifold Learning for Nonlinear Dimensionality Reduction
In recent years, nonlinear dimensionality reduction (NLDR) techniques have attracted much attention in visual perception and many other areas of science. We propose an efficient al...
Tony Lin, Hongbin Zha, Sang Uk Lee