10608 search results - page 264 / 2122 » Complexity of O'Hara's Algorithm |
112
Voted
HUMAN
2003
Springer
15 years 5 months ago
2003
Springer
Auctions have become popular in conducting trade negotiations on the Internet. The design of new auction formats and other negotiation protocols has become an important topic for r...
ACSC
2004
IEEE
15 years 4 months ago
2004
IEEE
Matrix multiplication is a basic computing operation. Whereas it is basic, it is also very expensive with a straight forward technique of O(N3 ) runtime complexity. More complex s...
104
Voted
CAD
2006
Springer
15 years 18 days ago
2006
Springer
Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative...
101
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
92
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...