Sciweavers

1092 search results - page 156 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
CVPR
2005
IEEE
16 years 8 months ago
Optimal Sub-Shape Models by Minimum Description Length
Active shape models are a powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a priori knowle...
Georg Langs, Philipp Peloschek, Horst Bischof
PODS
2008
ACM
143views Database» more  PODS 2008»
16 years 6 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
CP
2005
Springer
15 years 11 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus
COMPSAC
2007
IEEE
16 years 19 days ago
Learning Parameterized State Machine Model for Integration Testing
Although many of the software engineering activities can now be model-supported, the model is often missing in software development. We are interested in retrieving statemachine m...
Muzammil Shahbaz, Keqin Li 0002, Roland Groz
ISPDC
2007
IEEE
16 years 17 days ago
On Grid-based Matrix Partitioning for Heterogeneous Processors
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
Alexey L. Lastovetsky