1201 search results - page 77 / 241 » Linear Probing and Graphs |
139
click to vote
ITC
1999
IEEE
15 years 8 months ago
1999
IEEE
A high-level built-in self-test (BIST) synthesis involves several tasks such as system register assignment, interconnection assignment, and BIST register assignment. Existing high...
131
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
145
click to vote
MP
2006
15 years 4 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
158
click to vote
JMLR
2010
15 years 2 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
142
click to vote
JMLR
2010
14 years 11 months ago
2010
We present an algorithm to infer causal relations between a set of measured variables on the basis of experiments on these variables. The algorithm assumes that the causal relatio...