5606 search results - page 315 / 1122 » Randomization Techniques for Graphs. |
163
click to vote
CODES
2007
IEEE
16 years 28 days ago
2007
IEEE
One of the security issues in embedded system is the ability of an adversary to perform side channel attacks. Power analysis attacks are often very successful, where the power seq...
184
click to vote
ICPR
2010
IEEE
16 years 6 days ago
2010
IEEE
—We present a meta-learning framework for the design of potential functions for Conditional Random Fields. The design of both node potential and edge potential is formulated as a...
159
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
167
click to vote
ICCSA
2004
Springer
15 years 12 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
166
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...