Sciweavers

179 search results - page 15 / 36
» On Perfect Codes and Related Concepts
Sort
View
DM
2010
102views more  DM 2010»
14 years 10 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu
IJAR
2010
113views more  IJAR 2010»
14 years 8 months ago
A geometric view on learning Bayesian network structures
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...
Milan Studený, Jirí Vomlel, Raymond ...
NIPS
2001
14 years 11 months ago
Modeling Temporal Structure in Classical Conditioning
The Temporal Coding Hypothesis of Miller and colleagues [7] suggests that animals integrate related temporal patterns of stimuli into single memory representations. We formalize t...
Aaron C. Courville, David S. Touretzky
CORR
2007
Springer
149views Education» more  CORR 2007»
14 years 9 months ago
Graph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
Søren Riis
TSE
2010
140views more  TSE 2010»
14 years 8 months ago
Learning a Metric for Code Readability
—In this paper, we explore the concept of code readability and investigate its relation to software quality. With data collected from 120 human annotators, we derive associations...
Raymond P. L. Buse, Westley Weimer