1092 search results - page 76 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
166
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, . . . ). Composition is a more complex task. We isolate a larg...
143
click to vote
FOCS
2010
IEEE
15 years 3 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
167
click to vote
WDAG
2007
Springer
16 years 1 days ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
128
click to vote
SIAMCOMP
1998
15 years 5 months ago
1998
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
138
click to vote
ALGORITHMICA
2004
15 years 5 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...