3775 search results - page 287 / 755 » The Expression Problem Revisited |
160
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
153
click to vote
ICIP
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper a novel non-linear subspace method for face verification is proposed. The problem of face verification is considered as a two-class problem (genuine versus imposto...
160
click to vote
IPPS
2005
IEEE
16 years 9 days ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
172
click to vote
IWQOS
2004
Springer
16 years 2 days ago
2004
Springer
— The Internet still lacks adequate support for QoS applications with real-time requirements. In great part, this is due to the fact that provisioning of end-to-end QoS to traf...
206
click to vote
LPNMR
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...