Sciweavers

1787 search results - page 95 / 358
» Approximation Techniques for Spatial Data
Sort
View
CJ
1998
118views more  CJ 1998»
13 years 8 months ago
Least-Squares Structuring, Clustering and Data Processing Issues
Approximation structuring clustering is an extension of what is usually called square-error clustering" onto various cluster structures and data formats. It appears to be not...
Boris Mirkin
SEMWEB
2010
Springer
13 years 6 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood
MOR
2007
149views more  MOR 2007»
13 years 8 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
ICDE
2004
IEEE
99views Database» more  ICDE 2004»
14 years 10 months ago
Direct Mesh: a Multiresolution Approach to Terrain Visualization
Terrain can be approximated by a triangular mesh consisting millions of 3D points. Multiresolution triangular mesh (MTM) structures are designed to support applications that use t...
Kai Xu 0003, Xiaofang Zhou, Xuemin Lin
SC
2000
ACM
14 years 1 months ago
Improving Fine-Grained Irregular Shared-Memory Benchmarks by Data Reordering
We demonstrate that data reordering can substantially improve the performance of fine-grained irregular sharedmemory benchmarks, on both hardware and software shared-memory syste...
Y. Charlie Hu, Alan L. Cox, Willy Zwaenepoel