395 search results - page 30 / 79 » Positive Versions of Polynomial Time |
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
100
Voted
ICGI
2010
Springer
14 years 11 months ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
DAM
2006
14 years 10 months ago
2006
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
FORMATS
2005
Springer
15 years 3 months ago
2005
Springer
We consider real-time games where the goal consists, for each player, in maximizing the average amount of reward he or she receives per time unit. We consider zero-sum rewards, so ...
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
We present a new approach for dealing with distribution change and concept drift when learning from data sequences that may vary with time. We use sliding windows whose size, inst...