Sciweavers

9119 search results - page 1485 / 1824
» A Simultaneous Search Problem
Sort
View
PAMI
2008
208views more  PAMI 2008»
15 years 4 months ago
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
PR
2008
88views more  PR 2008»
15 years 4 months ago
Modified global k
Clustering in gene expression data sets is a challenging problem. Different algorithms for clustering of genes have been proposed. However due to the large number of genes only a ...
Adil M. Bagirov
PR
2006
229views more  PR 2006»
15 years 4 months ago
FS_SFS: A novel feature selection method for support vector machines
In many pattern recognition applications, high-dimensional feature vectors impose a high computational cost as well as the risk of "overfitting". Feature Selection addre...
Yi Liu, Yuan F. Zheng
SIAMSC
2008
182views more  SIAMSC 2008»
15 years 4 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
TALG
2008
67views more  TALG 2008»
15 years 4 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
« Prev « First page 1485 / 1824 Last » Next »