7228 search results - page 87 / 1446 » From Algorithmic to Subjective Randomness |
114
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper studies system identification of ARMA models whose outputs are subject to finite-level quantization and random packet dropouts. A simple adaptive quantizer and the co...
137
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Conditional random fields(CRFs) are a class of undirected graphical models which have been widely used for classifying and labeling sequence data. The training of CRFs is typicall...
120
click to vote
KDD
2004
ACM
16 years 3 months ago
2004
ACM
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
122
click to vote
IGPL
2006
15 years 3 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
137
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...