2181 search results - page 140 / 437 » The restriction scaffold problem |
93
Voted
DLOG
2007
15 years 3 months ago
2007
In this paper we deal with the problem of providing natural language front-ends to databases upon which an ontology layer has been added. Specifically, we are interested in expres...
106
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
107
Voted
TREC
2008
15 years 2 months ago
2008
PageRank is a way to rank Web pages taking into account hyper-link structure of the Web. PageRank provides efficient and simple method to find out ranking of Web pages exploiting ...
96
Voted
ACL
2003
15 years 2 months ago
2003
In statistical machine translation, the generation of a translation hypothesis is computationally expensive. If arbitrary wordreorderings are permitted, the search problem is NP-h...
112
click to vote
UAI
2004
15 years 2 months ago
2004
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...