15033 search results - page 422 / 3007 » Complexity Theory and Algorithms |
215
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
260
click to vote
STOC
2007
ACM
16 years 8 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
184
click to vote
COCO
2003
Springer
16 years 28 days ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
264
click to vote
FOCS
2000
IEEE
16 years 4 days ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
244
click to vote
WWW
2009
ACM
16 years 8 months ago
2009
ACM
Motivated by the emergence of auction-based marketplaces for display ads such as the Right Media Exchange, we study the design of a bidding agent that implements a display adverti...