400 search results - page 29 / 80 » Lower Bounds Using Kolmogorov Complexity |
CORR
2012
Springer
12 years 5 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
AIPS
2007
14 years 8 days ago
2007
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
ALT
2010
Springer
13 years 11 months ago
2010
Springer
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— In this paper, the concept of restricted real perturbation values of a complex matrix triplet is introduced, and a formula for computing lower bounds of these values is...