1554 search results - page 78 / 311 » Parameterized Complexity and Approximation Algorithms |
123
click to vote
NPAR
2004
ACM
15 years 8 months ago
2004
ACM
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
118
Voted
EMNLP
2008
15 years 4 months ago
2008
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
132
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
138
click to vote
GLOBECOM
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper, we propose a low-complexity iterative joint channel estimation, detection and decoding technique for doubly selective channels. The key is a segment-by-segment f...
121
click to vote
DAGSTUHL
2004
15 years 4 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...