6251 search results - page 1016 / 1251 » Randomness, Computability, and Density |
150
click to vote
ACL
2011
14 years 8 months ago
2011
It is well known that parsing accuracy suffers when a model is applied to out-of-domain data. It is also known that the most beneficial data to parse a given domain is data that ...
168
click to vote
CSR
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
207
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
163
click to vote
QUESTA
2011
14 years 7 months ago
2011
: 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...
174
click to vote
SDM
2011
SIAM
14 years 7 months ago
2011
SIAM
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...