656 search results - page 11 / 132 » Minimal non-convex words |
82
Voted
WIA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
ACL
2007
14 years 11 months ago
2007
Dependency structures do not have the information of phrase categories in phrase structure grammar. Thus, dependency parsing relies heavily on the lexical information of words. Th...
62
Voted
EOR
2006
14 years 9 months ago
2006
This paper is concerned with workload minimization in re-entrant lines with exponential service times and preemptive control policies. Using a numerical algorithm called the power...
104
click to vote
ACL
2010
14 years 7 months ago
2010
The pipeline of most Phrase-Based Statistical Machine Translation (PB-SMT) systems starts from automatically word aligned parallel corpus. But word appears to be too fine-grained ...
SSC
2007
Springer
15 years 3 months ago
2007
Springer
In this short note we introduce two new sequences defined using the sum of digits in the representation of an integer in a certain base. A connection to Niven numbers is proposed ...