876 search results - page 55 / 176 » Limits on the Usefulness of Random Oracles |
108
click to vote
ECCV
2010
Springer
15 years 26 days ago
2010
Springer
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
130
Voted
CPC
2010
14 years 10 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
113
Voted
FPGA
2008
ACM
15 years 2 months ago
2008
ACM
This paper introduces a method of constructing random number generators from four of the basic primitives provided by FPGAs: Flip-Flips, Lookup-Tables, Shift Registers, and RAMs. ...
103
Voted
APPROX
2000
Springer
15 years 5 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
104
Voted
WWW
2004
ACM
16 years 1 months ago
2004
ACM
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...