199 search results - page 34 / 40 » Computationally and Algebraically Complex Finite Algebra Mem... |
100
click to vote
MST
1998
15 years 1 months ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
123
click to vote
IS
2007
15 years 1 months ago
2007
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
148
click to vote
SMA
2009
ACM
15 years 7 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
123
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
126
click to vote
DAC
1994
ACM
15 years 5 months ago
1994
ACM
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...