Sciweavers

6045 search results - page 108 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
HPDC
1999
IEEE
14 years 8 days ago
An Evaluation of Linear Models for Host Load Prediction
This paper evaluates linear models for predicting the Digital Unix five-second load average from 1 to 30 seconds into the future. A detailed statistical study of a large number of...
Peter A. Dinda, David R. O'Hallaron
COLING
2010
13 years 2 months ago
Opinion Summarization with Integer Linear Programming Formulation for Sentence Extraction and Ordering
In this paper we propose a novel algorithm for opinion summarization that takes account of content and coherence, simultaneously. We consider a summary as a sequence of sentences ...
Hitoshi Nishikawa, Takaaki Hasegawa, Yoshihiro Mat...
SIAMSC
2011
219views more  SIAMSC 2011»
13 years 2 months ago
Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
H. P. Flath, Lucas C. Wilcox, Volkan Akcelik, Judi...
ICASSP
2011
IEEE
12 years 11 months ago
A combined linear programming-maximum likelihood approach to radial velocity data analysis for extrasolar planet detection
In this paper we introduce a new technique for estimating the parameters of the Keplerian model commonly used in radial velocity data analysis for extrasolar planet detection. The...
Prabhu Babu, Petre Stoica
FOCS
1999
IEEE
14 years 8 days ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan