5372 search results - page 797 / 1075 » complexity 2007 |
155
click to vote
CICLING
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. This paper describes the application of the perceptron algorithm to the morphological disambiguation of Turkish text. Turkish has a productive derivational morphology. Du...
155
click to vote
CIKM
2007
Springer
16 years 25 days ago
2007
Springer
Opinion leaders are those who bring in new information, ideas, and opinions, then disseminate them down to the masses, and thus influence the opinions and decisions of others by a...
157
click to vote
COCO
2007
Springer
16 years 25 days ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
162
click to vote
COCO
2007
Springer
16 years 25 days ago
2007
Springer
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
155
click to vote
COCOA
2007
Springer
16 years 25 days ago
2007
Springer
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...