Sciweavers

11784 search results - page 552 / 2357
» Interpolation for data structures
Sort
View
FPCA
1995
15 years 10 months ago
Shortcut Deforestation in Calculational Form
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
Akihiko Takano, Erik Meijer
ECCV
2010
Springer
15 years 9 months ago
Optimum Subspace Learning and Error Correction for Tensors
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...
DEBS
2007
ACM
15 years 8 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
COMPGEOM
2008
ACM
15 years 8 months ago
Self-improving algorithms for delaunay triangulations
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
Kenneth L. Clarkson, C. Seshadhri
CCCG
2008
15 years 8 months ago
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
Jonathan Derryberry, Don Sheehy, Maverick Woo, Dan...