Sciweavers

4886 search results - page 104 / 978
» Approximate Data Exchange
Sort
View
EDBT
2009
ACM
131views Database» more  EDBT 2009»
15 years 8 months ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 6 months ago
A Unified Approach to Approximate Proximity Searching
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
JMLR
2010
186views more  JMLR 2010»
14 years 11 months ago
Dimensionality Estimation, Manifold Learning and Function Approximation using Tensor Voting
We address instance-based learning from a perceptual organization standpoint and present methods for dimensionality estimation, manifold learning and function approximation. Under...
Philippos Mordohai, Gérard G. Medioni
INFOCOM
2011
IEEE
14 years 8 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
GM
1999
Springer
15 years 9 months ago
Data-Dependent Triangulation in the Plane with Adaptive Knot Placement
In many applications one is concerned with the approximation of functions from a finite set of scattered data sites with associated function values. We describe a scheme for cons...
René Schätzl, Hans Hagen, James C. Bar...