Sciweavers

6740 search results - page 1305 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
PODC
2005
ACM
14 years 1 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
ADC
2005
Springer
135views Database» more  ADC 2005»
14 years 1 months ago
A Path-based Relational RDF Database
We propose a path-based scheme for storage and retrieval of RDF data using a relational database. The Semantic Web is much anticipated as the nextgeneration web where high-level p...
Akiyoshi Matono, Toshiyuki Amagasa, Masatoshi Yosh...
ICALP
2005
Springer
14 years 1 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
CSB
2003
IEEE
130views Bioinformatics» more  CSB 2003»
14 years 29 days ago
A Computational Approach to Reconstructing Gene Regulatory Networks
Reverse-engineering of gene networks using linear models often results in an underdetermined system because of excessive unknown parameters. In addition, the practical utility of ...
Xutao Deng, Hesham H. Ali
P2P
2003
IEEE
110views Communications» more  P2P 2003»
14 years 28 days ago
The Effectiveness of Realistic Replication Strategies on Quality of Availability for Peer-to-Peer Systems
In this paper, we take an availability-centric view on quality of service (QoS) and propose a model and mechanisms for studying the effectiveness of realistic replication schemes ...
Giwon On, Jens Schmitt, Ralf Steinmetz
« Prev « First page 1305 / 1348 Last » Next »