Sciweavers

1018 search results - page 60 / 204
» Generative unbinding of names
Sort
View
ICANNGA
2009
Springer
203views Algorithms» more  ICANNGA 2009»
15 years 10 months ago
NEAT in HyperNEAT Substituted with Genetic Programming
In this paper we present application of genetic programming (GP) [1] to evolution of indirect encoding of neural network weights. We compare usage of original HyperNEAT algorithm w...
Zdenek Buk, Jan Koutník, Miroslav Snorek
MCS
2007
Springer
15 years 10 months ago
Group-Induced Vector Spaces
The strength of classifier combination lies either in a suitable averaging over multiple experts/sources or in a beneficial integration of complementary approaches. In this paper...
Manuele Bicego, Elzbieta Pekalska, Robert P. W. Du...
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 4 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
ICFP
2003
ACM
16 years 4 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
ICIP
2003
IEEE
16 years 5 months ago
Text to visual synthesis with appearance models
This paper presents a new method named text to visual synthesis with appearance models (TEVISAM) for generating videorealistic talking heads. In a first step, the system learns a ...
Javier Melenchón, Fernando De la Torre, Ign...