4192 search results - page 249 / 839 » Efficient testing of groups |
167
click to vote
ICIP
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper, we propose a series of techniques to enhance the computational performance of existing Belief Propagation (BP) based stereo matching that relies on automatic estima...
147
click to vote
ICML
2007
IEEE
16 years 6 months ago
2007
IEEE
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
147
click to vote
SIGSOFT
2004
ACM
16 years 6 months ago
2004
ACM
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
149
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
148
Voted
EDBT
2004
ACM
16 years 5 months ago
2004
ACM
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...