Sciweavers

331 search results - page 56 / 67
» A Clustering Algorithm Based Absorbing Nearest Neighbors
Sort
View
114
Voted
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
14 years 1 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...
TPDS
2002
173views more  TPDS 2002»
14 years 9 months ago
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an...
Stephanie Lindsey, Cauligi S. Raghavendra, Krishna...
ISMB
1993
14 years 10 months ago
Protein Classification Using Neural Networks
Wehave recently described a method based on Artificial Neural Networksto cluster protein sequences into families. The network was trained with Kohonen’s unsupervised-learning al...
Edgardo A. Ferrán, Pascual Ferrara, Bernard...
85
Voted
ICPP
2005
IEEE
15 years 3 months ago
Connected k-Hop Clustering in Ad Hoc Networks
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
Shuhui Yang, Jie Wu, Jiannong Cao
COLOGNETWENTE
2010
14 years 6 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...