Sciweavers

1385 search results - page 59 / 277
» Clustering by Random Projections
Sort
View
CVPR
2010
IEEE
15 years 1 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
15 years 5 months ago
Randomized Algorithms for Motif Detection
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
Lusheng Wang, Liang Dong, Hui Fan
BMCBI
2010
119views more  BMCBI 2010»
14 years 12 months ago
Functional classification of proteins based on projection of amino acid sequences: application for prediction of protein kinase
Background: The knowledge about proteins with specific interaction capacity to the protein partners is very important for the modeling of cell signaling networks. However, the exp...
Boris Sobolev, Dmitry Filimonov, Alexey Lagunin, A...
ICMLA
2004
15 years 1 months ago
PolyCluster: an interactive visualization approach to construct classification rules
This paper introduces a system, called PolyCluster, which adopts state-of-the-art algorithms for data visualization and integrates human domain knowledge into the construction pro...
Danyu Liu, Alan P. Sprague, Jeffrey G. Gray
JSAC
2007
124views more  JSAC 2007»
14 years 11 months ago
Optimal search performance in unstructured peer-to-peer networks with clustered demands
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
Saurabh Tewari, Leonard Kleinrock