Sciweavers

475 search results - page 15 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
DMIN
2009
142views Data Mining» more  DMIN 2009»
13 years 5 months ago
Efficient Record Linkage using a Double Embedding Scheme
Record linkage is the problem of identifying similar records across different data sources. The similarity between two records is defined based on domain-specific similarity functi...
Noha Adly
ICIP
2004
IEEE
14 years 9 months ago
Shape-adaptive coding using binary set splitting with k-d trees
The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed speci...
James E. Fowler
IPPS
2006
IEEE
14 years 1 months ago
Ant-inspired query routing performance in dynamic peer-to-peer networks
P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on qu...
Mojca Ciglaric, Tone Vidmar
ICDE
2002
IEEE
209views Database» more  ICDE 2002»
14 years 8 months ago
Geometric-Similarity Retrieval in Large Image Bases
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...
Ioannis Fudos, Leonidas Palios, Evaggelia Pitoura
ICPR
2004
IEEE
14 years 8 months ago
Spin Images for Retrieval of 3D Objects by Local and Global Similarity
The ever increasing availability of 3D models demands for tools supporting their effective and efficient management. Among these tools, those enabling content-based retrieval play...
Alberto Del Bimbo, Jürgen Assfalg, Pietro Pal...