Sciweavers

649 search results - page 97 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
WWW
2009
ACM
14 years 8 months ago
Latent space domain transfer between high dimensional overlapping distributions
Transferring knowledge from one domain to another is challenging due to a number of reasons. Since both conditional and marginal distribution of the training data and test data ar...
Sihong Xie, Wei Fan, Jing Peng, Olivier Verscheure...
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 7 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,...
SDM
2009
SIAM
144views Data Mining» more  SDM 2009»
14 years 4 months ago
On Segment-Based Stream Modeling and Its Applications.
The primary constraint in the effective mining of data streams is the large volume of data which must be processed in real time. In many cases, it is desirable to store a summary...
Charu C. Aggarwal
MM
2005
ACM
172views Multimedia» more  MM 2005»
14 years 1 months ago
Learning the semantics of multimedia queries and concepts from a small number of examples
In this paper we unify two supposedly distinct tasks in multimedia retrieval. One task involves answering queries with a few examples. The other involves learning models for seman...
Apostol Natsev, Milind R. Naphade, Jelena Tesic
W2GIS
2004
Springer
14 years 27 days ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou