Sciweavers

2043 search results - page 11 / 409
» A convenient category of domains
Sort
View
EMNLP
2008
13 years 9 months ago
Adapting a Lexicalized-Grammar Parser to Contrasting Domains
Most state-of-the-art wide-coverage parsers are trained on newspaper text and suffer a loss of accuracy in other domains, making parser adaptation a pressing issue. In this paper ...
Laura Rimell, Stephen Clark
ENTCS
2006
101views more  ENTCS 2006»
13 years 7 months ago
Towards "Dynamic Domains": Totally Continuous Cocomplete Q-categories
It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the d...
Isar Stubbe
CP
2007
Springer
14 years 1 months ago
Boosting Probabilistic Choice Operators
Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent...
Matthieu Petit, Arnaud Gotlieb
GCC
2003
Springer
14 years 26 days ago
SemanticPeer: An Ontology-Based P2P Lookup Service
Locating content efficiently and conveniently is the key issue in P2P systems. In this paper we present SemanticPeer, an Ontology-Based P2P lookup service, to address this problem,...
Jing Tian, Yafei Dai, Xiaoming Li
ICIP
2010
IEEE
13 years 5 months ago
Natural DCT statistics approach to no-reference image quality assessment
General-purpose no-reference image quality assessment approaches still lag the advances in full-reference methods. Most no-reference methods are either distortion specific (i.e. t...
Michele A. Saad, Alan C. Bovik, Christophe Charrie...