Sciweavers

Share
QUESTA
2011
8 years 1 months ago
Uniform approximations for the M/G/1 queue with subexponential processing times
: This paper studies the asymptotic behavior of the steady-state waiting time, W∞, of the M/G/1 queue with subexponenential processing times for different combinations of traffi...
Mariana Olvera-Cravioto, Peter W. Glynn
CORR
2011
Springer
174views Education» more  CORR 2011»
8 years 2 months ago
The Degree Sequence of Random Apollonian Networks
We analyze the asymptotic behavior of the degree sequence of Random Apollonian Networks [11]. For previous weaker results see [10, 11].
Charalampos E. Tsourakakis
ICTIR
2009
Springer
8 years 8 months ago
An Effective Approach to Verbose Queries Using a Limited Dependencies Language Model
Intuitively, any `bag of words' approach in IR should benefit from taking term dependencies into account. Unfortunately, for years the results of exploiting such dependencies ...
Eduard Hoenkamp, Peter Bruza, Dawei Song, Qiang Hu...
RSA
2008
125views more  RSA 2008»
8 years 9 months ago
The game chromatic number of random graphs
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
Tom Bohman, Alan M. Frieze, Benny Sudakov
SIAMCO
2000
110views more  SIAMCO 2000»
8 years 10 months ago
On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
We study the asymptotic behavior at infinity of solutions of a second order evolution equation with linear damping and convex potential. The differential system is defined in a rea...
Felipe Alvarez
COMBINATORICS
2004
99views more  COMBINATORICS 2004»
8 years 10 months ago
A Scaling Result for Explosive Processes
We consider the asymptotic behavior of the following model: balls are sequentially thrown into bins so that the probability that a bin with n balls obtains the next ball is propor...
Michael Mitzenmacher, Roberto Imbuzeiro Oliveira, ...
CPC
2007
76views more  CPC 2007»
8 years 10 months ago
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
Svante Janson, Joel Spencer
CCR
2008
112views more  CCR 2008»
8 years 10 months ago
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks
In the last few years, several studies have analyzed the performance of flooding and random walks as querying mechanisms for unstructured wireless sensor networks. However, most o...
Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash S...
INFOCOM
1995
IEEE
9 years 1 months ago
Dynamic Behavior of Feedback Congestion Control Schemes
This paper examines the asymptotic behavior of solutions of a simple network model using feedback control under the presence of delays. It shows numerically the existence of compl...
Giampiero Pecelli, B. G. Kim
books