10608 search results - page 272 / 2122 » Complexity of O'Hara's Algorithm |
TAPD
1998
15 years 1 months ago
1998
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
114
click to vote
MOC
2002
15 years 6 days ago
2002
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
110
click to vote
DATESO
2009
14 years 10 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
84
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
—The full-complexity soft-input/soft-output (SISO) multiuser detector based on the a posteriori probability (APP) algorithm has a computational complexity growing exponentially w...
121
Voted
ICIP
2007
IEEE
15 years 6 months ago
2007
IEEE
The multi-view video coding improves the coding efficiency by utilizing motion-compensated prediction (MCP) and disparity-compensated prediction (DCP). However, the complexity of ...