Sciweavers

3096 search results - page 185 / 620
» The Generalized FITC Approximation
Sort
View
117
Voted
ISAAC
2005
Springer
100views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Separability with Outliers
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
Sariel Har-Peled, Vladlen Koltun
ADBIS
1994
Springer
87views Database» more  ADBIS 1994»
15 years 9 months ago
Variations of R-Tree Structure for Indexing of Spatial Objects
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
M. G. Martynov
143
Voted
IPL
2008
135views more  IPL 2008»
15 years 5 months ago
On the Positive-Negative Partial Set Cover problem
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
Pauli Miettinen
145
Voted
SIAMNUM
2010
87views more  SIAMNUM 2010»
14 years 11 months ago
Flux Recovery and A Posteriori Error Estimators: Conforming Elements for Scalar Elliptic Equations
In this paper, we first study two flux recovery procedures for the conforming finite element approximation to general second-order elliptic partial differential equations. One is a...
Zhiqiang Cai, Shun Zhang
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 5 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb