767 search results - page 91 / 154 » On Clustering Using Random Walks |
164
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
173
click to vote
GLVLSI
2005
IEEE
15 years 11 months ago
2005
IEEE
We develop a novel on-line built-in self-test (BIST) technique for testing FPGAs that has a very high diagnosability even in presence of clustered faults, a fault pattern for whic...
158
click to vote
QUESTA
2006
15 years 5 months ago
2006
In this paper we consider a Poisson cluster process N as a generating process for the arrivals of packets to a server. This process generalizes in a more realistic way the infinite...
162
click to vote
FOCS
2006
IEEE
16 years 1 days ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
180
click to vote
EC
2006
15 years 6 months ago
2006
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...