Sciweavers

2600 search results - page 205 / 520
» Clustering with or without the Approximation
Sort
View
ACL
2011
14 years 10 months ago
Domain Adaptation by Constraining Inter-Domain Variability of Latent Feature Representation
We consider a semi-supervised setting for domain adaptation where only unlabeled data is available for the target domain. One way to tackle this problem is to train a generative m...
Ivan Titov
ICPR
2008
IEEE
16 years 7 months ago
Kernel bandwidth estimation in methods based on probability density function modelling
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
Adrian G. Bors, Nikolaos Nasios
ICANN
2007
Springer
16 years 22 days ago
Towards Understanding of Natural Language: Neurocognitive Inspirations
Neurocognitive processes responsible for representation of meaning and understanding of words are investigated. First a review of current knowledge about word representation, recen...
Wlodzislaw Duch, Pawel Matykiewicz, John Pestian
ISCC
2006
IEEE
123views Communications» more  ISCC 2006»
16 years 18 days ago
Similarity Search in a Hybrid Overlay P2P Network
P2P systems are increasingly used to discover and share various data between users. The performance of a P2P based information retrieval system is determined by the efficiency of...
Mouna Kacimi, Kokou Yétongnon
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
16 years 6 days ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini