5647 search results - page 243 / 1130 » A word from the editor |
169
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Human languages evolve continuously, and a puzzling problem is how to reconcile the apparent robustness of most of the deep linguistic structures we use with the evidence that the...
178
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
196
click to vote
GG
2004
Springer
16 years 12 hour ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
169
click to vote
TSD
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. A formal prosody model is proposed together with its application in a text-to-speech system. The model is based on a generative of abstract prosodic functionally involved...
150
click to vote
ISCIS
2003
Springer
15 years 11 months ago
2003
Springer
Feature selection is very important for many computer vision applications. However, it is hard to find a good measure for the comparison. In this study, feature sets are compared ...