Sciweavers

1458 search results - page 173 / 292
» Monads for incremental computing
Sort
View
144
Voted
NAACL
2007
15 years 5 months ago
Improved Inference for Unlexicalized Parsing
We present several improvements to unlexicalized parsing with hierarchically state-split PCFGs. First, we present a novel coarse-to-fine method in which a grammar’s own hierarc...
Slav Petrov, Dan Klein
119
Voted
IJCAI
2003
15 years 5 months ago
On the Foundations of Expected Expected Utility
Intelligent agents often need to assess user utility functions in order to make decisions on their behalf, or predict their behavior. When uncertainty exists over the precise natu...
Craig Boutilier
117
Voted
IJCAI
2003
15 years 5 months ago
Querying Distributed Data through Distributed Ontologies: A Simple but Scalable Approach
In this paper, we define a simple but scalable framework for peer-to-peer data sharing systems, in which the problem of answering queries over a network of semantically related p...
François Goasdoué, Marie-Christine R...
127
Voted
WSCG
2001
89views more  WSCG 2001»
15 years 5 months ago
Searching Triangle Strips Guided by Simplification Criterion
Triangle strips are widely used as a method to accelerate the visualisation process of polygon models in interactive graphics applications. Another widely used method to improve d...
Oscar Belmonte, José Ribelles, Inmaculada R...
270
Voted
ACL
1998
15 years 5 months ago
Maximum Entropy Model Learning of the Translation Rules
This paper proposes a learning method of translation rules from parallel corpora. This method applies the maximum entropy principle to a probabilistic model of translation rules. ...
Kengo Sato, Masakazu Nakanishi