381 search results - page 73 / 77 » Fast Neighbor Joining |
EDBT
2008
ACM
15 years 10 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
PERCOM
2008
ACM
15 years 9 months ago
2008
ACM
Existing code update protocols for reprogramming nodes in a sensor network are either unsuitable or inefficient when used in a mobile environment. The prohibitive factor of uncert...
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
102
click to vote
BIBM
2009
IEEE
15 years 4 months ago
2009
IEEE
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
ICIG
2009
IEEE
15 years 4 months ago
2009
IEEE
We present a simple and fast method for performing unsupervised segmentation. Our method works by centering a square window on each pixel of the input image. Each pixel is then as...