2531 search results - page 33 / 507 » Group testing in graphs |
STOC
2006
ACM
14 years 10 months ago
2006
ACM
FUZZIEEE
2007
IEEE
14 years 4 months ago
2007
IEEE
—Approaches based on conditional independence tests are among the most popular methods for learning graphical models from data. Due to the predominance of Bayesian networks in th...
ISCAS
2003
IEEE
14 years 3 months ago
2003
IEEE
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iter...
COMBINATORICA
1999
13 years 10 months ago
1999
We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite or far from being bipartite. Graphs are represented by incidence lists of bounded len...
ICCV
2011
IEEE
12 years 10 months ago
2011
IEEE
This paper addresses the challenge of recognizing behavior of groups of individuals in unconstraint surveillance environments. As opposed to approaches that rely on agglomerative ...