Sciweavers

1061 search results - page 26 / 213
» Natural Selection in Relation to Complexity
Sort
View
COLING
1990
13 years 9 months ago
A PDP Architecture For Processing Sentences With Relative Clauses
A modular parallel distributed processing architecture for parsing, representing and paraphrasing sentences with multiple hierarchical relative clauses is presented. A lowel-level...
Risto Miikkulainen
NIPS
2004
13 years 9 months ago
Breaking SVM Complexity with Cross-Training
We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...
Gökhan H. Bakir, Léon Bottou, Jason We...
SC
2003
ACM
14 years 29 days ago
Nondeterministic Queries in a Relational Grid Information Service
A Grid Information Service (GIS) stores information about the resources of a distributed computing environment and answers questions about it. We are developing RGIS, a GIS system...
Peter A. Dinda, Dong Lu
TSD
2007
Springer
14 years 1 months ago
Quality Deterioration Factors in Unit Selection Speech Synthesis
Abstract. The purpose of the present paper is to examine the relationships between target and concatenation costs and the quality (with focus on naturalness) of generated speech. S...
Daniel Tihelka, Jindrich Matousek, Jirí Kal...
FOIKS
2008
Springer
13 years 9 months ago
Lossless Decompositions in Complex-Valued Databases
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
Henning Köhler, Sebastian Link