702 search results - page 93 / 141 » Identifying Graph Automorphisms Using Determining Sets |
KDD
2004
ACM
16 years 6 days ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
110
click to vote
AMFG
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract. Subspace analysis has been widely used for head pose estimation. However, such techniques are usually sensitive to data alignment and background noise. In this paper a tw...
BMCBI
2008
14 years 12 months ago
2008
Background: The rapid growth of biomedical literature presents challenges for automatic text processing, and one of the challenges is abbreviation identification. The presence of ...
183
click to vote
GIS
2005
ACM
16 years 25 days ago
2005
ACM
Numerous raster maps are available on the Internet, but the geographic coordinates of the maps are often unknown. In order to determine the precise location of a raster map, we ex...
117
click to vote
CLUSTER
2002
IEEE
14 years 11 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...