Sciweavers

1579 search results - page 18 / 316
» How Good is the Crowd at
Sort
View
IDA
1997
Springer
14 years 4 days ago
How to Find Big-Oh in Your Data Set (and How Not to)
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...
Catherine C. McGeoch, Doina Precup, Paul R. Cohen
CORR
2007
Springer
160views Education» more  CORR 2007»
13 years 8 months ago
How really effective are Multimodal Hints in enhancing Visual Target Spotting? Some evidence from a usability study
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...
Suzanne Kieffer, Noelle Carbonell
CCS
2007
ACM
14 years 2 months ago
How much anonymity does network latency leak?
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...
ATAL
2008
Springer
13 years 10 months ago
Trajectories of goods in distributed allocation
Distributed allocation mechanisms rely on the agents' autonomous (and supposedly rational) behaviour: states evolve as a result of agents contracting deals and exchanging res...
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
ICML
2006
IEEE
14 years 8 months ago
Learning algorithms for online principal-agent problems (and selling goods online)
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...
Vincent Conitzer, Nikesh Garera