3819 search results - page 182 / 764 » Simple Easy Terms |
209
click to vote
JOT
2007
15 years 6 months ago
2007
This paper describes how to extract stock quote data and display it with a dynamic update (using free, but delayed data streams). As a part of the architecture of the program, we ...
188
Voted
CORR
2000
Springer
15 years 6 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
219
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
200
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
161
click to vote
BIRTHDAY
2005
Springer
16 years 17 days ago
2005
Springer
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...