312 search results - page 11 / 63 » Line spectral pairs |
IWCMC
2010
ACM
14 years 2 months ago
2010
ACM
—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
DILS
2008
Springer
13 years 11 months ago
2008
Springer
We propose a novel semi-supervised clustering method for the task of gene regulatory module discovery. The technique uses data on dna binding as prior knowledge to guide the proces...
CORR
2010
Springer
2010
Springer
Understanding periodicity and regularity of nodal encounters in mobile networks: A spectral analysis
13 years 9 months ago
Abstract--Study on human mobility is gaining increasing attention from the research community with its multiple applications to use in mobile networks, particularly for the purpose...
MSR
2010
ACM
14 years 2 months ago
2010
ACM
—This paper presents an approach to automatically distinguish the copied clone from the original in a pair of clones. It matches the line-by-line version information of a clone t...
IPL
2002
13 years 9 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...