95 search results - page 2 / 19 » Improved Exact Algorithms for Counting 3- and 4-Colorings |
TIP
2011
12 years 11 months ago
2011
—The removal of Poisson noise is often performed through the following three-step procedure. First, the noise variance is stabilized by applying the Anscombe root transformation ...
ICTCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...