656 search results - page 9 / 132 » Minimal non-convex words |
ANLP
1997
14 years 11 months ago
1997
We describe an annotation scheme and a tool developed for creating linguistically annotated corpora for non-configurational languages. Since the requirements for such a formalism ...
68
Voted
COGSCI
2010
14 years 9 months ago
2010
A well-established principle of language is that there is a preference for closely related words to be close together in the sentence. This can be expressed as a preference for de...
68
Voted
EOR
2008
14 years 9 months ago
2008
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
83
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...
SIAMCOMP
2000
14 years 9 months ago
2000
We investigate a conjecture stated by Coffman, Flatto, and Wright within the context of a stochastic machine minimization problem with a hard deadline. We prove that the conjecture...