9849 search results - page 37 / 1970 » Algorithms and Experiments for the Webgraph |
121
click to vote
COLING
2010
14 years 8 months ago
2010
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...
125
click to vote
JMLR
2010
14 years 8 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
144
click to vote
ISBI
2011
IEEE
14 years 5 months ago
2011
IEEE
We develop a new algorithm to segment the hippocampus from MR images. Our method uses a new classifier ensemble algorithm to correct segmentation errors produced by a multi-atlas...
132
Voted
ICC
2011
IEEE
14 years 1 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
136
Voted
PPSN
2010
Springer
14 years 11 months ago
2010
Springer
We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the `best' one? and the second one:...