98 search results - page 7 / 20 » Approximate counting in bounded arithmetic |
125
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
111
click to vote
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
133
Voted
CORR
2012
Springer
13 years 9 months ago
2012
Springer
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
107
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
110
click to vote
DAWAK
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...