4926 search results - page 286 / 986 » Two Graph Algorithms On an Associative Computing Model |
176
click to vote
CPM
2007
Springer
15 years 11 months ago
2007
Springer
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...
116
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
137
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
158
click to vote
RECOMB
2005
Springer
16 years 5 months ago
2005
Springer
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...
124
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...