The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
The main aim of the work presented here is to contribute to computer science advances in the multimodal usability area, in-as-much as it addresses one of the major issues relating...
Low-latency anonymity systems such as Tor, AN.ON, Crowds, and Anonymizer.com aim to provide anonymous connections that are both untraceable by “local” adversaries who control ...
Nicholas Hopper, Eugene Y. Vasserman, Eric Chan-Ti...
Distributed allocation mechanisms rely on the agents' autonomous (and supposedly rational) behaviour: states evolve as a result of agents contracting deals and exchanging res...
In a principal-agent problem, a principal seeks to motivate an agent to take a certain action beneficial to the principal, while spending as little as possible on the reward. This...