191 search results - page 8 / 39 » The basic feasible functionals in computable analysis |
124
Voted
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we study the feasibility of SIFT features for the tasks of object recognition and tracking within the framework of the IVSEE system design. The IVSEE system is inte...
111
click to vote
ICLP
2007
Springer
15 years 5 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
121
click to vote
LICS
2003
IEEE
15 years 7 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
101
click to vote
ICPR
2006
IEEE
16 years 2 months ago
2006
IEEE
In cast-shadow analysis one merely draws a line between each occluder and its associated shadow cast onto a different surface, possibly with wedges indicating precision. In some c...
DAC
2010
ACM
15 years 5 months ago
2010
ACM
Understanding the flow of information is an important aspect in computer security. There has been a recent move towards tracking information in hardware and understanding the flow...