Sciweavers

3628 search results - page 159 / 726
» The Decision Diffie-Hellman Problem
Sort
View
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
14 years 1 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
IJCAI
2007
13 years 11 months ago
Concept Sampling: Towards Systematic Selection in Large-Scale Mixed Concepts in Machine Learning
This paper addresses the problem of concept sampling. In many real-world applications, a large collection of mixed concepts is available for decision making. However, the collecti...
Yi Zhang 0010, Xiaoming Jin
STOC
2006
ACM
107views Algorithms» more  STOC 2006»
14 years 10 months ago
On basing one-way functions on NP-hardness
We consider the possibility of basing one-way functions on NP-Hardness; that is, we study possible reductions from a worst-case decision problem to the task of average-case invert...
Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana...
IPL
1998
95views more  IPL 1998»
13 years 9 months ago
A Variation on the Zero-One Law
Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...
Andreas Blass, Yuri Gurevich, Vladik Kreinovich, L...
ICONIP
2009
13 years 7 months ago
A Markov Model for Multiagent Patrolling in Continuous Time
Abstract. We present a model for the multiagent patrolling problem with continuous-time. An anytime and online algorithm is then described and extended to asynchronous multiagent d...
Jean-Samuel Marier, Camille Besse, Brahim Chaib-dr...