Sciweavers

597 search results - page 47 / 120
» Homomorphisms of random paths
Sort
View
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 10 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 10 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
DATE
2006
IEEE
127views Hardware» more  DATE 2006»
14 years 4 months ago
A signal theory based approach to the statistical analysis of combinatorial nanoelectronic circuits
In this paper we present a method which allows the statistical analysis of nanoelectronic Boolean networks with respect to timing uncertainty and noise. All signals are considered...
Oliver Soffke, Peter Zipf, Tudor Murgan, Manfred G...
INFOCOM
2006
IEEE
14 years 4 months ago
Avoiding Oscillations Due to Intelligent Route Control Systems
Abstract— Intelligent Route Control (IRC) systems are increasingly deployed in multihomed networks. IRC systems aim to optimize the cost and performance of outgoing traffic, bas...
Ruomei Gao, Constantinos Dovrolis, Ellen W. Zegura
ICNP
1997
IEEE
14 years 2 months ago
Balanced Routing
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
Jorge Arturo Cobb, Mohamed G. Gouda