1421 search results - page 252 / 285 » Algorithms for subsequence combinatorics |
128
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
206
Voted
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Schema integration is the problem of creating a unified target schema based on a set of existing source schemas that relate to each other via specified correspondences. The unifie...
148
Voted
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
144
Voted
EDBT
2010
ACM
15 years 9 months ago
2010
ACM
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
116
Voted
RECONFIG
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—The main challenge when implementing cryptographic algorithms in hardware is to protect them against attacks that target directly the device. Two strategies are customar...