Sciweavers

42 search results - page 1 / 9
» Practical Methods for Shape Fitting and Kinetic Data Structu...
Sort
View
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
13 years 5 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 2 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
BMCBI
2010
143views more  BMCBI 2010»
13 years 4 months ago
Shape based kinetic outlier detection in real-time PCR
Background: Real-time PCR has recently become the technique of choice for absolute and relative nucleic acid quantification. The gold standard quantification method in real-time P...
Davide Sisti, Michele Guescini, Marco B. L. Rocchi...
VRCAI
2006
ACM
13 years 10 months ago
Kinetic bounding volume hierarchies for deformable objects
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
Gabriel Zachmann, Rene Weller
COCOA
2008
Springer
13 years 6 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth