Sciweavers

745 search results - page 85 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
BMCBI
2008
179views more  BMCBI 2008»
15 years 22 days ago
Building pathway clusters from Random Forests classification using class votes
Background: Recent years have seen the development of various pathway-based methods for the analysis of microarray gene expression data. These approaches have the potential to bri...
Herbert Pang, Hongyu Zhao
DEBU
2010
180views more  DEBU 2010»
15 years 21 days ago
Searching RDF Graphs with SPARQL and Keywords
The proliferation of knowledge-sharing communities like Wikipedia and the advances in automated information extraction from Web pages enable the construction of large knowledge ba...
Shady Elbassuoni, Maya Ramanath, Ralf Schenkel, Ge...
SPAA
2005
ACM
15 years 6 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
85
Voted
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 5 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
INFOCOM
2002
IEEE
15 years 5 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...