499 search results - page 65 / 100 » Constructive Induction by Analogy |
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Generating multimedia streams, such as in a netradio, is a task which is complex and difficult to adapt to every users’ needs. We introduce a novel approach in order to achieve i...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
MM
2006
ACM
14 years 2 months ago
2006
ACM
In this paper, we draw an analogy between image retrieval and text retrieval and propose a visual phrase-based approach to retrieve images containing desired objects. The visual p...
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...