172 search results - page 23 / 35 » Improving the Time Complexity of Matsui's Linear Cryptanalys... |
DCC
2006
IEEE
15 years 11 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
104
click to vote
COR
2010
14 years 11 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
186
Voted
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
96
Voted
NIPS
2003
15 years 1 months ago
2003
Nonlinear filtering can solve very complex problems, but typically involve very time consuming calculations. Here we show that for filters that are constructed as a RBF network ...
PODC
2009
ACM
16 years 6 days ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...