1552 search results - page 244 / 311 » On the Complexity of Constant Propagation |
103
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
123
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
CW
2005
IEEE
15 years 1 months ago
2005
IEEE
Large Virtual Worlds (VWs) are increasingly common in the computer graphics areas of simulation, games, geospatial or scientific visualisation. In such VWs, simulated motion of th...
COCO
2008
Springer
15 years 1 months ago
2008
Springer
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
COCO
2008
Springer
15 years 1 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...