Sciweavers

263 search results - page 39 / 53
» Regret Bounds for Prediction Problems
Sort
View
ICC
1997
IEEE
108views Communications» more  ICC 1997»
14 years 2 months ago
Overflow Probability in an ATM Queue with Self-Similar Input Traffic
Real measurements in high-speed communications networks have recently shown that traffic may demonstrate properties of long-range dependency peculiar to self-similar stochastic pr...
Boris Tsybakov, Nicolas D. Georganas
INFOCOM
1996
IEEE
14 years 2 months ago
Integrated Control of Connection Admission, Flow Rate, and Bandwidth for ATM Based Networks
: We consider the combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, service-rate) under nonstationary conditions. A fluid flow model ...
Andreas Pitsillides, Petros A. Ioannou, David Tipp...
RECOMB
2010
Springer
13 years 11 months ago
Subnetwork State Functions Define Dysregulated Subnetworks in Cancer
Abstract. Emerging research demonstrates the potential of proteinprotein interaction (PPI) networks in uncovering the mechanistic bases of cancers, through identification of intera...
Salim A. Chowdhury, Rod K. Nibbe, Mark R. Chance, ...
CSL
2007
Springer
14 years 4 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart
ICCAD
1994
IEEE
106views Hardware» more  ICCAD 1994»
14 years 2 months ago
On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
Yu-Liang Wu, Douglas Chang