Sciweavers

2520 search results - page 75 / 504
» The complexity of approximating entropy
Sort
View
TSP
2008
86views more  TSP 2008»
14 years 10 months ago
Fixed-Complexity Soft MIMO Detection via Partial Marginalization
Abstract--This paper presents a new approach to soft demodulation for MIMO channels. The proposed method is an approximation to the exact a posteriori probability-per-bit computer....
Erik G. Larsson, Joakim Jalden
WSCG
2004
185views more  WSCG 2004»
14 years 11 months ago
Automatic Fitting and Control of Complex Freeform Shapes in 3-D
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Yu Song, Joris S. M. Vergeest, Chensheng Wang
TSP
2008
119views more  TSP 2008»
14 years 10 months ago
The Shiftable Complex Directional Pyramid - Part II: Implementation and Applications
In Part I ["The shiftable complex directional pyramid--Part I: Theoretical Aspects," IEEE TRANSACTIONS ON SIGNAL PROCESSING, vol. 56, no. 10, October 2008], we proposed a...
Truong T. Nguyen, Soontorn Oraintara
SIGGRAPH
1997
ACM
15 years 2 months ago
Progressive simplicial complexes
In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier prog...
Jovan Popovic, Hugues Hoppe
MST
2007
138views more  MST 2007»
14 years 9 months ago
Parameterized Complexity of Vertex Cover Variants
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke