Sciweavers

32545 search results - page 31 / 6509
» Data Structures and Algorithms
Sort
View
COSIT
1997
Springer
143views GIS» more  COSIT 1997»
14 years 20 days ago
Using Hierarchical Spatial Data Structures for Hierarchical Spatial Reasoning
This paper gives a definition of Hierarchical Spatial Reasoning, which computes increasingly better results in a hierarchical fashion and stops the computation when a result is ac...
Sabine Timpf, Andrew U. Frank
IEEEMSP
2002
IEEE
14 years 1 months ago
Factorization with missing data for 3D structure recovery
—Matrix factorization methods are now widely used to recover 3D structure from 2D projections [1]. In practice, the observation matrix to be factored out has missing data, due to...
Rui F. C. Guerreiro, Pedro M. Q. Aguiar
MASCOTS
2001
13 years 10 months ago
PROFS-Performance-Oriented Data Reorganization for Log-Structured File System on Multi-Zone Disks
I/O is a major performance bottleneck in modern computer systems. Modern disks use the Zone-Bit-Recording (ZBR) technology to increase the capacity. A direct consequence of ZBR is...
Jun Wang, Yiming Hu
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
14 years 3 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
GRAPHICSINTERFACE
2001
13 years 10 months ago
Accelerated Splatting using a 3D Adjacency Data Structure
We introduce a new acceleration to the standard splatting volume rendering algorithm. Our method achieves full colour (32-bit), depth-sorted and shaded volume rendering significan...
Jeff Orchard, Torsten Möller