1920 search results - page 189 / 384 » The Complexity of the A B C Problem |
182
click to vote
ADT
2005
15 years 6 months ago
2005
: The main problem concerning the hardware implementation of turbo codes is the lack of parallelism in the MAP-based decoding algorithm. This paper proposes to overcome this proble...
181
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
193
click to vote
ICIP
2008
IEEE
16 years 8 months ago
2008
IEEE
Two Dimensional Hidden Markov Models (2D-HMMs) provide substantial benefits for many computer vision and image analysis applications. Many fundamental image analysis problems, inc...
154
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
175
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...