11051 search results - page 382 / 2211 » An Investigation of Generalized Cases |
201
click to vote
COLT
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. We present a generalization of the Perceptron algorithm. The new algorithm performs a Perceptron-style update whenever the margin of an example is smaller than a predefi...
192
click to vote
APN
2004
Springer
16 years 1 months ago
2004
Springer
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...
175
click to vote
EUROCRYPT
1999
Springer
15 years 12 months ago
1999
Springer
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
181
click to vote
ACMACE
2007
ACM
15 years 11 months ago
2007
ACM
We present a wizard of Oz framework for the simulation of locationbased mobile games. We explore briefly the methodological concept of Wizard of Oz and show, based on a case study...