Sciweavers

451 search results - page 23 / 91
» On Parameterized Exponential Time Complexity
Sort
View
VIS
2006
IEEE
157views Visualization» more  VIS 2006»
14 years 11 months ago
Analyzing Complex FTMS Simulations: a Case Study in High-Level Visualization of Ion Motions
Current practice in particle visualization renders particle position data directly onto the screen as points or glyphs. Using a camera placed at a fixed position, particle motions...
Wojciech Burakiewicz, Robert van Liere
IWCMC
2006
ACM
14 years 3 months ago
Low complexity design of space-time convolutional codes with high spectral efficiencies
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
Kyungmin Kim, Hamid R. Sadjadpour, Rick S. Blum, Y...
TC
2008
13 years 9 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
PODS
2004
ACM
109views Database» more  PODS 2004»
14 years 10 months ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
14 years 4 months ago
Random sampling of moment graph: a stochastic Krylov-reduction algorithm
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
Zhenhai Zhu, Joel R. Phillips