125 search results - page 8 / 25 » N Semantic Classes are Harder than Two |
EUROCRYPT
2001
Springer
15 years 2 months ago
2001
Springer
At EuroCrypt’99, Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-resi...
MOC
2002
14 years 9 months ago
2002
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
CLEF
2005
Springer
15 years 3 months ago
2005
Springer
This article describes the use of the medGIFT and easyIR retrieval systems for three of the four ImageCLEF 2005 retrieval tasks. We participated in the ad–hoc retrieval task that...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
We introduce a framework, which we call Divide-by-2 (DB2), for extending support vector machines (SVM) to multi-class problems. DB2 offers an alternative to the standard one-again...
150
click to vote
PEPM
2009
ACM
16 years 9 months ago
2009
ACM
The Verilog hardware description language has padding semantics that allow designers to write descriptions where wires of different bit widths can be interconnected. However, many ...