Sciweavers

1091 search results - page 99 / 219
» On the temporal dimension of search
Sort
View
CIKM
2008
Springer
15 years 3 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
126
Voted
CEC
2010
IEEE
15 years 2 months ago
Learning-assisted evolutionary search for scalable function optimization: LEM(ID3)
Inspired originally by the Learnable Evolution Model(LEM) [5], we investigate LEM(ID3), a hybrid of evolutionary search with ID3 decision tree learning. LEM(ID3) involves interleav...
Guleng Sheri, David Corne
BMCBI
2010
196views more  BMCBI 2010»
14 years 11 months ago
Content-based microarray search using differential expression profiles
Background: With the expansion of public repositories such as the Gene Expression Omnibus (GEO), we are rapidly cataloging cellular transcriptional responses to diverse experiment...
Jesse M. Engreitz, Alexander A. Morgan, Joel Dudle...
DEXA
2006
Springer
126views Database» more  DEXA 2006»
15 years 3 months ago
Hypersphere Indexer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
Navneet Panda, Edward Y. Chang, Arun Qamra
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
14 years 5 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...