Sciweavers

761 search results - page 142 / 153
» Efficient Approximation Algorithms for the Subset-Sums Equal...
Sort
View
COMPGEOM
2007
ACM
13 years 11 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
14 years 7 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
CGF
2010
156views more  CGF 2010»
13 years 7 months ago
Mixed Finite Elements for Variational Surface Modeling
Many problems in geometric modeling can be described using variational formulations that define the smoothness of the shape and its behavior w.r.t. the posed modeling constraints....
Alec Jacobson, Elif Tosun, Olga Sorkine, Denis Zor...
SIAMSC
2008
142views more  SIAMSC 2008»
13 years 7 months ago
Multitarget Error Estimation and Adaptivity in Aerodynamic Flow Simulations
Important quantities in aerodynamic flow simulations are the aerodynamic force coefficients including the pressure induced and the viscous stress induced drag, lift and moment coef...
Ralf Hartmann
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 1 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...