Results 1  10
of
2,234,386
Markovmodulated infiniteserver queues:
"... This paper studies an infiniteserver queue in a semiMarkov environment: the queue’s input rate is modulated by a semiMarkovian background process, and the service times are assumed to be exponentially distributed. The primary objective of this paper is to propose approximations for the queueleng ..."
Abstract
 Add to MetaCart
This paper studies an infiniteserver queue in a semiMarkov environment: the queue’s input rate is modulated by a semiMarkovian background process, and the service times are assumed to be exponentially distributed. The primary objective of this paper is to propose approximations for the queue
A LARGEDEVIATIONS ANALYSIS OF MARKOVMODULATED INFINITESERVER QUEUES
"... ABSTRACT. This paper studies an infiniteserver queue in a Markov environment, that is, an infiniteserver queue with arrival rates and service times depending on the state of a Markovian background process. Scaling the arrival rates λi by a factor N, tail probabilities are examined when letting N te ..."
Abstract
 Add to MetaCart
ABSTRACT. This paper studies an infiniteserver queue in a Markov environment, that is, an infiniteserver queue with arrival rates and service times depending on the state of a Markovian background process. Scaling the arrival rates λi by a factor N, tail probabilities are examined when letting N
Nonparametric model for background subtraction
 in ECCV ’00
, 2000
"... Abstract. Background subtraction is a method typically used to segment moving regions in image sequences taken from a static camera by comparing each new frame to a model of the scene background. We present a novel nonparametric background model and a background subtraction approach. The model can ..."
Abstract

Cited by 538 (17 self)
 Add to MetaCart
Abstract. Background subtraction is a method typically used to segment moving regions in image sequences taken from a static camera by comparing each new frame to a model of the scene background. We present a novel nonparametric background model and a background subtraction approach. The model
For Most Large Underdetermined Systems of Linear Equations the Minimal ℓ1norm Solution is also the Sparsest Solution
 Comm. Pure Appl. Math
, 2004
"... We consider linear equations y = Φα where y is a given vector in R n, Φ is a given n by m matrix with n < m ≤ An, and we wish to solve for α ∈ R m. We suppose that the columns of Φ are normalized to unit ℓ 2 norm 1 and we place uniform measure on such Φ. We prove the existence of ρ = ρ(A) so that ..."
Abstract

Cited by 560 (10 self)
 Add to MetaCart
We consider linear equations y = Φα where y is a given vector in R n, Φ is a given n by m matrix with n < m ≤ An, and we wish to solve for α ∈ R m. We suppose that the columns of Φ are normalized to unit ℓ 2 norm 1 and we place uniform measure on such Φ. We prove the existence of ρ = ρ(A) so
The LargeScale Organization of Metabolic Networks
, 2000
"... In a cell or microorganism the processes that generate mass, energy, information transfer, and cell fate specification are seamlessly integrated through a complex network of various cellular constituents and reactions. However, despite the key role these networks play in sustaining various cellular ..."
Abstract

Cited by 599 (7 self)
 Add to MetaCart
and errortolerant networks, and may represent a common blueprint for the largescale organization of interactions among all cellular constituents.
Network Coding for Large Scale Content Distribution
"... We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling of bloc ..."
Abstract

Cited by 497 (6 self)
 Add to MetaCart
We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling
SNOPT: An SQP Algorithm For LargeScale Constrained Optimization
, 2002
"... Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first deriv ..."
Abstract

Cited by 582 (23 self)
 Add to MetaCart
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first
CYC: A LargeScale Investment in Knowledge Infrastructure
 Communications of the ACM
, 1995
"... This article examines the fundamental ..."
A Field Study of the Software Design Process for Large Systems
 Communications of the ACM
, 1988
"... The problems of designing large software systems were studied through interviewing personnel from 17 large projects. A layered behavioral model is used to analyze how three lgf these problemsthe thin spread of application domain knowledge, fluctuating and conflicting requirements, and communication ..."
Abstract

Cited by 663 (2 self)
 Add to MetaCart
The problems of designing large software systems were studied through interviewing personnel from 17 large projects. A layered behavioral model is used to analyze how three lgf these problemsthe thin spread of application domain knowledge, fluctuating and conflicting requirements
TIMESCALING LIMITS FOR MARKOVMODULATED INFINITESERVER QUEUES
"... ABSTRACT. In this paper we study semiMarkov modulated M/M/ ∞ queues, which are to be understood as infiniteserver systems in which the Poisson input rate is modulated by a Markovian background process (where the times spent in each of its states are assumed deterministic), and the service times ar ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
ABSTRACT. In this paper we study semiMarkov modulated M/M/ ∞ queues, which are to be understood as infiniteserver systems in which the Poisson input rate is modulated by a Markovian background process (where the times spent in each of its states are assumed deterministic), and the service times
Results 1  10
of
2,234,386