635 search results - page 46 / 127 » Some Computational Problems Related to Pseudo-intents |
204
Voted
STACS
2005
Springer
16 years 7 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
162
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Head pose estimation has many useful applications in practice. How to estimate the head pose automatically and robustly is still a challenging problem. In pose estimation, differe...
206
click to vote
CSE
2008
IEEE
16 years 1 months ago
2008
IEEE
E-mail services are essential in the Internet. However, the basic e-mail architecture presents problems that opens it to several threats. Alternatives have been proposed to solve ...
208
click to vote
ACL2
2006
ACM
16 years 23 days ago
2006
ACM
Several users have had problems using equivalence-based rewriting in ACL2 because the ACL2 rewriter caches its results. We describe this problem in some detail, together with a pa...
184
click to vote
ACTA
2007
15 years 7 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...