1208 search results - page 24 / 242 » On Counting Generalized Colorings |
ACL
2009
13 years 5 months ago
2009
Kneser-Ney (1995) smoothing and its variants are generally recognized as having the best perplexity of any known method for estimating N-gram language models. Kneser-Ney smoothing...
ICCS
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents a generalized demosaicking procedure suitable for single-sensor imaging devices. By employing an edge-sensing mechanism and a spectral model, the proposed demos...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
ISIPTA
2005
IEEE
14 years 1 months ago
2005
IEEE
The main goal of this paper is to describe a new semantic for conditional independence in terms of no double counting of uncertain evidence. For ease of exposition, we use probabi...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...