1729 search results - page 276 / 346 » Bound Graph Polysemy |
134
click to vote
COMBINATORICS
1999
15 years 4 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
126
click to vote
TC
1998
15 years 4 months ago
1998
—Many built-in self-testing (BIST) schemes compress the test responses from a k-output circuit to q signature streams, where q << k, a process termed space compaction. The ...
164
click to vote
WALCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
176
click to vote
COLT
2010
Springer
15 years 3 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
159
Voted
TALG
2011
14 years 12 months ago
2011
We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected c...