11231 search results - page 451 / 2247 » Digging for Data Structures |
199
click to vote
COMGEO
2004
ACM
15 years 7 months ago
2004
ACM
We design a kinetic data structure for detecting collisions between two simple polygons in motion. In order to do so, we create a planar subdivision of the free space between the ...
201
click to vote
SIGPLAN
2002
15 years 7 months ago
2002
We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming. The purpose of the system is to support the algorithm...
231
click to vote
ICOODB
2009
15 years 5 months ago
2009
This paper presents algorithms that make it possible to process XML data that conforms to XML Schema (XSD) in a mainstream object-oriented programming language. These algorithms a...
255
click to vote
CVPR
2012
IEEE
13 years 10 months ago
2012
IEEE
The choice of the over-complete dictionary that sparsely represents data is of prime importance for sparse codingbased image super-resolution. Sparse coding is a typical unsupervi...
231
click to vote
VVS
2000
IEEE
16 years 1 days ago
2000
IEEE
A novel approach for rendering time-varying data based on the Shear-Warp factorisation is presented. Reduction in storage space is achieved by detecting the changed areas within e...