2626 search results - page 126 / 526 » The complexity of stochastic sequences |
185
click to vote
LFCS
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
169
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
170
click to vote
ACL
2006
15 years 7 months ago
2006
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...
205
click to vote
PRL
2002
15 years 6 months ago
2002
The "fly algorithm" is a fast artificial evolution-based technique devised for the exploration of parameter space in pattern recognition applications. In the application...
208
click to vote
EMNLP
2009
15 years 4 months ago
2009
We use the technique of SVM anchoring to demonstrate that lexical features extracted from a training corpus are not necessary to obtain state of the art results on tasks such as N...