Sciweavers

1921 search results - page 152 / 385
» Stereo Without Search
Sort
View
CORR
2000
Springer
110views Education» more  CORR 2000»
15 years 3 months ago
Efficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
Brian Roark, Mark Johnson
NAACL
2010
15 years 2 months ago
Two monolingual parses are better than one (synchronous parse)
We describe a synchronous parsing algorithm that is based on two successive monolingual parses of an input sentence pair. Although the worst-case complexity of this algorithm is a...
Chris Dyer
WWW
2007
ACM
16 years 4 months ago
Answering relationship queries on the web
Finding relationships between entities on the Web, e.g., the connections between different places or the commonalities of people, is a novel and challenging problem. Existing Web ...
Gang Luo, Chunqiang Tang, Ying-li Tian
RECSYS
2009
ACM
15 years 10 months ago
Latent dirichlet allocation for tag recommendation
Tagging systems have become major infrastructures on the Web. They allow users to create tags that annotate and categorize content and share them with other users, very helpful in...
Ralf Krestel, Peter Fankhauser, Wolfgang Nejdl
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 10 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...