6315 search results - page 133 / 1263 » Approximating Solution Structure |
189
click to vote
SIBGRAPI
2008
IEEE
16 years 23 days ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
171
click to vote
TVCG
1998
15 years 6 months ago
1998
—Numerical simulation of physical phenomena is now an accepted way of scientific inquiry. However, the field is still evolving, with a profusion of new solution and grid-generati...
143
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
191
click to vote
COMPGEOM
2005
ACM
15 years 8 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...
299
click to vote
ICDE
2002
IEEE
16 years 7 months ago
2002
IEEE
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...