Searching for "On Counting and Approximation." – sorted by Relevance.
-
When Crossings Count - Approximating the Minimum Spanning Tree
- When Crossings Count | Approximating the Minimum Spanning Tree Sariel Har-Peled y Piotr Indyk
- Cited by 9 (5 self) – Add To MetaCart
-
Approximate counting by dynamic programming
- Approximate Counting by Dynamic Programming Martin Dyer \Lambda November 4th, 2002 Abstract
- Cited by 11 (4 self) – Add To MetaCart
-
Approximately counting integral flows and cellbounded contingency tables
- Approximately Counting Integral Flows and Cell-Bounded Contingency Tables ∗ Mary Cryan † , Martin
- Cited by 2 (0 self) – Add To MetaCart
-
Approximate counting of inversions in a data stream
- Approximate counting of inversions in a data stream Mikl'os Ajtai T. S. Jayram Ravi Kumar D
- Cited by 25 (2 self) – Add To MetaCart
-
Balanced Hashing, Color Coding and Approximate Counting (Extended Abstract)
- Balanced Hashing, Color Coding and Approximate Counting (Extended Abstract) Noga Alon ∗ Shai
- Add To MetaCart
-
Range minima queries with respect to a random permutation, and approximate range counting, Discrete
- Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting ∗ Haim
- Cited by 3 (3 self) – Add To MetaCart
-
Discovering Frequent Tree Patterns over Data Streams
- , a framework for counting the approximate frequencies of the candidate tree patterns is presented
- Cited by 1 (0 self) – Add To MetaCart
-
Smoothing Methods In Maximum Entropy Language Modeling
- ) that maximum entropy models with nested features and discounted feature counts approximate backing
- Cited by 1 (0 self) – Add To MetaCart
-
Sensitive Functions and Approximate Problems
- problem. It is shown that approximate selection, approximate counting, approximate compaction and padded
- Add To MetaCart
-
Sampling lattice points
- is essentially the best possible. 1 Introduction In this paper we consider the problem of counting approximately
- Cited by 7 (1 self) – Add To MetaCart

