351 search results - page 69 / 71 » Algebra and Geometry of Rewriting |
SPAA
2004
ACM
13 years 11 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
NIXDORF
1992
13 years 10 months ago
1992
We present some quantitative performance measurements for the computing power of Programmable Active Memories (PAM), as introduced by [2]. Based on Field Programmable Gate Array (...
SCA
2007
13 years 8 months ago
2007
We describe a method for animating incompressible liquids with detailed free surfaces. For each time step, semiLagrangian contouring computes a new fluid boundary (represented as ...
FOCS
2008
IEEE
13 years 6 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...