Searching for "A $O(\log m)$" – sorted by Relevance.
20 documents found, showing 1 through 10.
Next 10 →
-
Separable Attributes: a Technique for Solving the Sub Matrices Character Count Problem
- … can be computed in time O(n log m), in a computational model with word size O(log m). However…
- Cited by 3 (0 self) – Add To MetaCart
-
Improved Algorithms for Scheduling Data Broadcast
- … in such environments. This algorithm is based on a fair queueing algorithm [6], and can be executed in O(log M) time…
- Cited by 13 (3 self) – Add To MetaCart
-
Efficient Algorithms for Scheduling Single and Multiple Channel Data Broadcast
- … on a fair queueing algorithm [6], and can be executed in O(log M) time, where M is the number…
- Cited by 8 (0 self) – Add To MetaCart
-
Approximation algorithms for combinatorial auctions with complement-free bidders
- … polynomial time algorithm that finds a O(log m) approximation for valuations in the class CF using demand…
- Cited by 51 (12 self) – Add To MetaCart
-
Dynamic Shannon Coding
- …’s Formula, xlog x − xln 2 < log(x!) ≤ xlog x − xln 2 + O(log x) . Thus, L < m log m − m ln 2 − � � � #a(S)log…
- Cited by 5 (3 self) – Add To MetaCart
-
Binary collusion-secure codes: Comparison and improvements
- … a key size of nO logq! = O(logM) bits, where nO is the outer code length and q is the outer code…
- Cited by 1 (1 self) – Add To MetaCart
-
Combinatorial meaning of Kolmogorov complexity
- … up to a O(log m) term where m is the sum of complexities of all strings involved; we omit O(log m…
- Add To MetaCart
-
Load Balancing and Locality in Range-Queriable Data
- …|) DHT lookups, where each DHT lookup typically incurring a O(log m) cost. The system is load…
- Cited by 3 (2 self) – Add To MetaCart
-
Inequalities for Shannon entropies and Kolmogorov complexities
- … to O(log m) term). The conditional version of mutual information is defined as I(a : bjc) = K(ajc) +K…
- Cited by 9 (4 self) – Add To MetaCart
-
Efficient binary conversion for Paillier encrypted values
- … < y]], respectively. A O(log m)depth circuit for equality is straightforward, leading to round…
- Cited by 2 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
