Sciweavers

136 search results - page 15 / 28
» Efficient kernel feature extraction for massive data sets
Sort
View
WWW
2003
ACM
14 years 8 months ago
Efficient URL caching for world wide web crawling
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
Andrei Z. Broder, Marc Najork, Janet L. Wiener
3DPVT
2004
IEEE
136views Visualization» more  3DPVT 2004»
13 years 11 months ago
Efficient Model Creation of Large Structures based on Range Segmentation
This paper describes an efficient 3D modeling method from 3D range data-sets that is utilizing range data segmentation. Our algorithm starts with a set of unregistered 3D range sc...
Ioannis Stamos, Marius Leordeanu
EMMCVPR
2007
Springer
14 years 1 months ago
3D Computation of Gray Level Co-occurrence in Hyperspectral Image Cubes
This study extended the computation of GLCM (gray level co-occurrence matrix) to a three-dimensional form. The objective was to treat hyperspectral image cubes as volumetric data s...
Fuan Tsai, Chun-Kai Chang, Jian-Yeo Rau, Tang-Huan...
IJCSA
2006
129views more  IJCSA 2006»
13 years 7 months ago
The SH-Tree: A Novel and Flexible Super Hybrid Index Structure for Similarity Search on Multidimensional Data
Approaches to indexing and searching feature vectors are an indispensable factor to support similarity search effectively and efficiently. Such feature vectors extracted from real...
Tran Khanh Dang
JDCTA
2010
119views more  JDCTA 2010»
13 years 2 months ago
Distributed Dual Cluster Algorithm Based on Grid for Sensor Streams
In practical applications, Wireless Sensor Networks generate massive data streams with the dual attributes in geography and optimization domain. Energy source of sensor nodes in W...
Jianghua Huang, Junying Zhang