10289 search results - page 393 / 2058 » Standard bases in K |
185
click to vote
VLSID
2010
IEEE
15 years 5 months ago
2010
IEEE
The paper analyzes cache based timing attacks on optimized codes for Advanced Encryption Standard (AES). The work justifies that timing based cache attacks create hits in the fi...
193
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
153
click to vote
AI
2005
Springer
16 years 10 days ago
2005
Springer
The instance-based k-nearest neighbor algorithm (KNN)[1] is an effective classification model. Its classification is simply based on a vote within the neighborhood, consisting o...
169
click to vote
EUROCAST
2005
Springer
16 years 10 days ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
212
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...