1431 search results - page 8 / 287 » The complexity of random ordered structures |
COCO
2004
Springer
14 years 24 days ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
BMCBI
2008
13 years 7 months ago
2008
Background: Large biological data sets, such as expression profiles, benefit from reduction of random noise. Principal component (PC) analysis has been used for this purpose, but ...
ECOOP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
ANOR
2008
13 years 7 months ago
2008
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...