Sciweavers

3110 search results - page 208 / 622
» On the initialization of the DNMF algorithm
Sort
View
SPIRE
2010
Springer
15 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
TKDE
2010
210views more  TKDE 2010»
15 years 4 months ago
Structural and Role-Oriented Web Service Discovery with Taxonomies in OWL-S
—In this paper, we describe and evaluate a Web service discovery framework using OWL-S advertisements, combined with the distinction between service and Web service of the WSMO D...
Georgios Meditskos, Nick Bassiliades
AIRS
2010
Springer
15 years 4 months ago
Advanced Training Set Construction for Retrieval in Historic Documents
Retrieval in historic documents with non-standard spelling requires a mapping from search terms onto the historic terms in the document. For describing this mapping, we have develo...
Andrea Ernst-Gerlach, Norbert Fuhr
CVPR
2010
IEEE
15 years 4 months ago
P-N learning: Bootstrapping binary classifiers by structural constraints
This paper shows that the performance of a binary classifier can be significantly improved by the processing of structured unlabeled data, i.e. data are structured if knowing the ...
Zdenek Kalal, Jiri Matas, Krystian Mikolajczyk
EMNLP
2010
15 years 4 months ago
Training Continuous Space Language Models: Some Practical Issues
Using multi-layer neural networks to estimate the probabilities of word sequences is a promising research area in statistical language modeling, with applications in speech recogn...
Hai Son Le, Alexandre Allauzen, Guillaume Wisniews...