75 search results - page 14 / 15 » Hard Instances of the Constrained Discrete Logarithm Problem |
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
ASIACRYPT
2003
Springer
14 years 22 days ago
2003
Springer
We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). ...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, ma...