Sciweavers

635 search results - page 46 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
89
Voted
STACS
2005
Springer
15 years 3 months ago
Algorithmics in Exponential Time
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 ...
Uwe Schöning
ICPR
2008
IEEE
15 years 11 months ago
Head pose estimation: Classification or regression?
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...
Charles R. Dyer, Guodong Guo, Thomas S. Huang, Yun...
94
Voted
CSE
2008
IEEE
15 years 4 months ago
A Trust Model Applied to E-mail Servers
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 ...
Leonardo de Oliveira, Carlos Maziero
ACL2
2006
ACM
15 years 3 months ago
Double rewriting for equivalential reasoning in ACL2
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...
Matt Kaufmann, J. Strother Moore
ACTA
2007
96views more  ACTA 2007»
14 years 9 months ago
Recursive Petri nets
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...
Serge Haddad, Denis Poitrenaud