4047 search results - page 296 / 810 » The Discrete Basis Problem |
173
Voted
COMPGEOM
1996
ACM
15 years 9 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
161
click to vote
CAAN
2007
Springer
15 years 8 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
131
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
138
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
116
click to vote
ACSD
2004
IEEE
15 years 8 months ago
2004
IEEE
Over the last 25 years, methods for supervisory control of discrete event systems and methods for submodule construction based on state machine specifications have been developed ...