CSR
2011
Springer
13 years 2 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
SRDS
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
DIAGRAMS
2008
Springer
14 years 28 days ago
2008
Springer
Abstract. We present a brief description of the design of a diagrambased system that supports the development of thinking about mathematical generalisation. Within the software, th...
CISS
2007
IEEE
14 years 3 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
LOPSTR
2007
Springer
14 years 5 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
INFOCOM
2009
IEEE
14 years 5 months ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...