Sciweavers

2714 search results - page 195 / 543
» Approximation Schemes for Scheduling
Sort
View
TR
2008
164views more  TR 2008»
15 years 3 months ago
Inference Based on Type-II Hybrid Censored Data From a Weibull Distribution
A hybrid censoring scheme is a mixture of Type-I and Type-II censoring schemes. This article presents the statistical inferences on Weibull parameters when the data are Type-II hyb...
Aveek Banerjee, Debasis Kundu
ICDE
2010
IEEE
188views Database» more  ICDE 2010»
16 years 3 months ago
Space-efficient Online Approximation of Time Series Data: Streams, Amnesia, and Out-of-order
In this paper, we present an abstract framework for online approximation of time-series data that yields a unified set of algorithms for several popular models: data streams, amnes...
Sorabh Gandhi, Luca Foschini, Subhash Suri
JMLR
2011
125views more  JMLR 2011»
14 years 10 months ago
Approximate Marginals in Latent Gaussian Models
We consider the problem of improving the Gaussian approximate posterior marginals computed by expectation propagation and the Laplace method in latent Gaussian models and propose ...
Botond Cseke, Tom Heskes
VLDB
2005
ACM
129views Database» more  VLDB 2005»
15 years 9 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
ISAAC
2004
Springer
141views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Jérôme Monnot, Vangelis Th. Paschos, ...