971 search results - page 135 / 195 » Comparative Analysis of Arithmetic Coding Computational Comp... |
133
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
99
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
118
click to vote
TWC
2008
15 years 2 months ago
2008
Abstract-- We present a unified detection framework for spatial multiplexing multiple-input multiple-output (MIMO) systems by generalizing Heller's classical feedback decoding...
179
Voted
ICIP
2005
IEEE
16 years 4 months ago
2005
IEEE
Bezier curves (BC) are fundamental to a wide range of applications from computer-aided design through to object shape descriptions and surface mapping. Since BC only consider glob...
133
Voted
QSHINE
2005
IEEE
15 years 8 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...