1244 search results - page 82 / 249 » Searching in Higher Dimension |
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
CIKM
2008
Springer
14 years 2 hour ago
2008
Springer
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...
CEC
2010
IEEE
13 years 11 months ago
2010
IEEE
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...
BMCBI
2010
13 years 7 months ago
2010
Background: With the expansion of public repositories such as the Gene Expression Omnibus (GEO), we are rapidly cataloging cellular transcriptional responses to diverse experiment...
DEXA
2006
Springer
13 years 12 months ago
2006
Springer
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...