6300 search results - page 149 / 1260 » We have it easy, but do we have it right |
OOPSLA
2004
Springer
15 years 6 months ago
2004
Springer
These notes have the status of letters written to ourselves: we wrote them down because, without doing so, we found ourselves making rguments over and over again. So began the abs...
119
click to vote
ENTCS
2006
15 years 1 months ago
2006
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...
ASIACRYPT
2001
Springer
15 years 5 months ago
2001
Springer
One interesting and important challenge for the cryptologic community is that of providing secure authentication and identification for unassisted humans. There are a range of prot...
138
click to vote
ITP
2010
15 years 3 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
103
click to vote
ICPR
2000
IEEE
15 years 5 months ago
2000
IEEE
All the methods for estimating the fundamental matrix do not naturally exploit the rank-2 constraint. For these reason some few rank-2 parameterizations of the fundamental matrix ...