Sciweavers

2801 search results - page 3 / 561
» On the Adequateness of the Connection Method
Sort
View
APPROX
2004
Springer
105views Algorithms» more  APPROX 2004»
14 years 29 days ago
Counting Connected Graphs and Hypergraphs via the Probabilistic Method
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwala...
CN
2010
92views more  CN 2010»
13 years 5 months ago
Deadline-based connection setup in wavelength-routed WDM networks
This article addresses the ubiquitous topic of Quality of Service (QoS) aware connection provisioning in wavelength routed WDM optical networks. The impact of the connection setup...
Wissam Fawaz, Iyad Ouaiss, Ken Chen, Harry G. Perr...
BMCBI
2008
77views more  BMCBI 2008»
13 years 7 months ago
A simple and robust method for connecting small-molecule drugs using gene-expression signatures
Background: Interaction of a drug or chemical with a biological system can result in a geneexpression profile or signature characteristic of the event. Using a suitably robust alg...
Shu-Dong Zhang, Timothy W. Gant
SIAMSC
2011
85views more  SIAMSC 2011»
12 years 10 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss
TABLEAUX
1995
Springer
13 years 11 months ago
A Connection Based Proof Method for Intuitionistic Logic
We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search t...
Jens Otten