Sciweavers

715 search results - page 65 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
BIOINFORMATICS
2011
14 years 6 months ago
Integrative network alignment reveals large regions of global network similarity in yeast and human
Motivation: High-throughput methods for detecting molecular interactions have produced large sets of biological network data with much more yet to come. Analogous to sequence alig...
Oleksii Kuchaiev, Natasa Przulj
PUK
2003
15 years 1 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
ICDCS
2003
IEEE
15 years 5 months ago
The Hash History Approach for Reconciling Mutual Inconsistency
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
ByungHoon Kang, Robert Wilensky, John Kubiatowicz
BMCBI
2008
145views more  BMCBI 2008»
14 years 12 months ago
Directed acyclic graph kernels for structural RNA analysis
Background: Recent discoveries of a large variety of important roles for non-coding RNAs (ncRNAs) have been reported by numerous researchers. In order to analyze ncRNAs by kernel ...
Kengo Sato, Toutai Mituyama, Kiyoshi Asai, Yasubum...
LCN
2007
IEEE
15 years 6 months ago
Search Algorithms for Unstructured Peer-to-Peer Networks
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
Reza Dorrigiv, Alejandro López-Ortiz, Pawel...