Sciweavers

2869 search results - page 230 / 574
» The Inference Problem: A Survey
Sort
View
JWSR
2007
89views more  JWSR 2007»
15 years 7 months ago
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
CORR
2000
Springer
75views Education» more  CORR 2000»
15 years 7 months ago
A Learning Approach to Shallow Parsing
A SNoW based learning approach to shallow parsing tasks is presented and studied experimentally. The approach learns to identify syntactic patterns by combining simple predictors ...
Marcia Muñoz, Vasin Punyakanok, Dan Roth, D...
CP
2010
Springer
15 years 5 months ago
Local Consistency and SAT-Solvers
In this paper we show that the power of using k-consistency techniques in a constraint problem is precisely captured by using a particular inference rule, which we call positive-hy...
Justyna Petke, Peter Jeavons
MT
2010
96views more  MT 2010»
15 years 5 months ago
Monte Carlo techniques for phrase-based translation
Recent advances in statistical machine translation have used approximate beam search for NP-complete inference within probabilistic translation models. We present an alternative ap...
Abhishek Arun, Barry Haddow, Philipp Koehn, Adam L...
CVPR
2011
IEEE
15 years 4 months ago
Distributed Message Passing for Large Scale Graphical Models
In this paper we propose a distributed message-passing algorithm for inference in large scale graphical models. Our method can handle large problems efficiently by distributing a...
Alexander Schwing, Hazan Tamir, Marc Pollefeys, Ra...