1405 search results - page 67 / 281 » Popularity at Minimum Cost |
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
IJNSEC
2010
14 years 4 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
ALENEX
2004
14 years 11 months ago
2004
We prove that the variance of the number of different letters in random words of length n, with letters i and probabilities 2-i attached to them, is 1 + o(1). Likewise, the varian...
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
Most existing ULP (unequal loss protection) schemes do not consider the minimum quality requirement and usually have high computation complexity. Previously, we proposed a layered...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...