1538 search results - page 114 / 308 » Relative Randomness and Cardinality |
ISTCS
1995
Springer
15 years 1 months ago
1995
Springer
We call a vector x 2 IRn highly regular if it satis es < x m >= 0 for some short, non{zero integer vector m where < : : > is the inner product. We present an algorithm...
TIT
2008
14 years 9 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
CIIT
2007
14 years 11 months ago
2007
To characterize the behavior of a mobile ad-hoc network (MANET), the Brownian mobility model is studied, where the random coordinators of mobile nodes are modeled by the Brownian ...
112
click to vote
GEM
2007
14 years 11 months ago
2007
- Besides the difficulty of the application problem to be solved with Genetic Algorithms (GAs), an additional difficulty arises because the quality of the solution found, or the ...