Sciweavers

Share
95 search results - page 2 / 19
» Improved Exact Algorithms for Counting 3- and 4-Colorings
Sort
View
TIP
2011
84views more  TIP 2011»
9 years 8 months ago
Optimal Inversion of the Anscombe Transformation in Low-Count Poisson Image Denoising
—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 ...
Markku Makitalo, Alessandro Foi
ICTCS
2005
Springer
10 years 7 months ago
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems
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...
Venkatesh Raman, Saket Saurabh, Somnath Sikdar
COMPGEOM
2001
ACM
10 years 5 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
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...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
INFOCOM
2012
IEEE
8 years 3 months ago
The Variable-Increment Counting Bloom Filter
—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...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
FOCS
2006
IEEE
10 years 7 months ago
Inclusion--Exclusion Algorithms for Counting Set Partitions
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...
Andreas Björklund, Thore Husfeldt
books