Sciweavers

3019 search results - page 12 / 604
» Approximating the Domatic Number
Sort
View
CORR
2012
Springer
193views Education» more  CORR 2012»
12 years 3 months ago
Approximate Counting of Matchings in Sparse Hypergraphs
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
ICASSP
2011
IEEE
12 years 11 months ago
On the effectiveness of the Dark Channel Prior for single image dehazing by approximating with minimum volume ellipsoids
There is an increasing number of methods for removing haze and fog from a single image. One of such methods is Dark Channel Prior (DCP). The goal of this paper is to develop a mat...
Kristofor B. Gibson, Truong Q. Nguyen
MOC
1998
106views more  MOC 1998»
13 years 7 months ago
Computations of class numbers of real quadratic fields
In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected ti...
Anitha Srinivasan
GD
2008
Springer
13 years 8 months ago
Crossing and Weighted Crossing Number of Near-Planar Graphs
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
Sergio Cabello, Bojan Mohar
APCCAS
2006
IEEE
206views Hardware» more  APCCAS 2006»
13 years 11 months ago
On the Properties And Design of Stable IIR Transfer Functions Generated Using Fibonnaci Numbers
This paper considers z-domain transfer functions whose denominator polynomial possesses the property that the coefficient of zi is greater than the coefficient of zi-1 . Such trans...
Christian S. Gargour, Venkat Ramachandran, Ravi P....