Sciweavers

1238 search results - page 144 / 248
» Knowledge Extraction from Local Function Networks
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
ICANN
2009
Springer
13 years 6 months ago
Mining Rules for the Automatic Selection Process of Clustering Methods Applied to Cancer Gene Expression Data
Different algorithms have been proposed in the literature to cluster gene expression data, however there is no single algorithm that can be considered the best one independently on...
André C. A. Nascimento, Ricardo Bastos Cava...
BMCBI
2008
133views more  BMCBI 2008»
13 years 9 months ago
SPIKE - a database, visualization and analysis tool of cellular signaling pathways
Background: Biological signaling pathways that govern cellular physiology form an intricate web of tightly regulated interlocking processes. Data on these regulatory networks are ...
Ran Elkon, Rita Vesterman, Nira Amit, Igor Ulitsky...
JECR
2002
120views more  JECR 2002»
13 years 8 months ago
Strategic Connectivity in Extended Enterprise Networks
Extended enterprises are networks of organizations interconnected to exchange critical resources, such as raw materials, labor, access to markets, specialized skills and knowledge...
John Tillquist
WWW
2003
ACM
14 years 9 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...