4451 search results - page 615 / 891 » On Random Ordering Constraints |
168
click to vote
NIPS
2007
15 years 8 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
191
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
195
click to vote
SDM
2003
SIAM
15 years 8 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
188
click to vote
ANLP
2000
15 years 8 months ago
2000
This paper describes an approach to providing lexical information for natural language processing in unrestricted domains. A system of approximately 1200 morphological rules is us...
170
click to vote
WSC
2000
15 years 8 months ago
2000
Input modeling that involves fitting standard univariate parametric probability distributions is typically performed using an input modeling package. These packages typically fit ...