4451 search results - page 432 / 891 » On Random Ordering Constraints |
175
click to vote
TON
2002
15 years 6 months ago
2002
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
204
click to vote
PAMI
2007
15 years 6 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
171
click to vote
JAT
2010
15 years 5 months ago
2010
The paper investigates the properties of certain biorthogonal polynomials appearing in a specific simultaneous Hermite–Pad´e approximation scheme. Associated with any totally ...
150
click to vote
MA
2010
Springer
15 years 5 months ago
2010
Springer
We characterize the angular polyspectra, of arbitrary order, associated with isotropic fields defined on the sphere S2 = (x, y, z) : x2 + y2 + z2 = 1 . Our techniques rely heavi...
165
click to vote
TALG
2010
15 years 5 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...