Sciweavers

2093 search results - page 205 / 419
» Statistical Point Geometry
Sort
View
COMPGEOM
2011
ACM
14 years 7 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
COMPGEOM
2011
ACM
14 years 7 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
BMCBI
2008
129views more  BMCBI 2008»
15 years 4 months ago
A unified approach to false discovery rate estimation
Background: False discovery rate (FDR) methods play an important role in analyzing highdimensional data. There are two types of FDR, tail area-based FDR and local FDR, as well as ...
Korbinian Strimmer
VIS
2003
IEEE
145views Visualization» more  VIS 2003»
16 years 5 months ago
Signed Distance Transform Using Graphics Hardware
This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of the Euclidean distance to a given manifold of co-di...
Christian Sigg, Markus H. Gross, Ronald Peikert
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
16 years 4 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount