451 search results - page 23 / 91 » On Parameterized Exponential Time Complexity |
136
Voted
VIS
2006
IEEE
16 years 4 months ago
2006
IEEE
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...
132
Voted
IWCMC
2006
ACM
15 years 9 months ago
2006
ACM
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
134
Voted
TC
2008
15 years 3 months ago
2008
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 ...
100
Voted
PODS
2004
ACM
16 years 3 months ago
2004
ACM
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...
120
Voted
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
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...