Sciweavers

451 search results - page 57 / 91
» On Parameterized Exponential Time Complexity
Sort
View
EOR
2008
88views more  EOR 2008»
13 years 10 months ago
Algorithmic analysis of the Geo/Geo/c
In this paper, we consider a discrete-time queue of Geo/Geo/c type with geometric repeated attempts. It is known that its continuous counterpart, namely the M/M/c queue with expon...
Jesus R. Artalejo, Antonis Economou, Antonio G&oac...
CORR
2011
Springer
213views Education» more  CORR 2011»
13 years 5 months ago
Adapting to Non-stationarity with Growing Expert Ensembles
Forecasting sequences by expert ensembles generally assumes stationary or near-stationary processes; however, in complex systems and many real-world applications, we are frequentl...
Cosma Rohilla Shalizi, Abigail Z. Jacobs, Aaron Cl...
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
14 years 11 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng
ATVA
2006
Springer
106views Hardware» more  ATVA 2006»
14 years 1 months ago
Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier E...
NIPS
2008
13 years 11 months ago
Continuously-adaptive discretization for message-passing algorithms
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Michael Isard, John MacCormick, Kannan Achan