1422 search results - page 232 / 285 » Test Generation Algorithms Based on Preorder Relations |
WWW
2008
ACM
15 years 10 months ago
2008
ACM
This paper considers the problem of identifying on the Web compound documents (cDocs) ? groups of web pages that in aggregate constitute semantically coherent information entities...
100
click to vote
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
118
click to vote
ECCV
2008
Springer
15 years 8 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
103
click to vote
CGF
2006
14 years 9 months ago
2006
Based on the potential of current programmable GPUs, recently several approaches were developed that use the GPU to calculate deformations of surfaces like the folding of cloth or...
ICGI
2010
Springer
14 years 8 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...