451 search results - page 62 / 91 » Some Lower Bounds on Geometric Separability Problems |
IOR
2011
14 years 4 months ago
2011
We consider a pricing problem in an environment where the customers’ willingness-to-pay (WtP) distribution may change at some point over the selling horizon. Customers arrive se...
JUCS
2010
14 years 8 months ago
2010
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
114
click to vote
CCECE
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
WG
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...