4797 search results - page 195 / 960 » The complexity of partition tasks |
170
click to vote
STOC
2010
ACM
16 years 6 hour ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
235
click to vote
MKWI
2008
15 years 8 months ago
2008
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
216
click to vote
PUK
2001
15 years 8 months ago
2001
The sales of customisable products and services over the internet is a challenging task within the area of electronic commerce. In this chapter we will present a case study which s...
207
click to vote
COLT
2010
Springer
15 years 5 months ago
2010
Springer
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
240
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on supercomputers using a high-level language without grappling with the ...