Sciweavers

89 search results - page 15 / 18
» Fast Algorithm for Nearest Neighbor Search Based on a Lower ...
Sort
View
162
Voted
ICDE
2012
IEEE
227views Database» more  ICDE 2012»
13 years 5 months ago
Horizontal Reduction: Instance-Level Dimensionality Reduction for Similarity Search in Large Document Databases
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...
Min-Soo Kim 0001, Kyu-Young Whang, Yang-Sae Moon
IJCNN
2000
IEEE
15 years 7 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
127
Voted
SPAA
2005
ACM
15 years 8 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
116
Voted
EDBT
2008
ACM
132views Database» more  EDBT 2008»
16 years 2 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
128
Voted
ANOR
2011
117views more  ANOR 2011»
14 years 6 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover