114 search results - page 17 / 23 » The Tree Inclusion Problem: In Linear Space and Faster |
ICCAD
1997
IEEE
15 years 1 months ago
1997
IEEE
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...
CIVR
2009
Springer
15 years 4 months ago
2009
Springer
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
ICML
2007
IEEE
15 years 10 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...
DAC
2005
ACM
15 years 10 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...