Sciweavers

394 search results - page 12 / 79
» Expected Case for Projecting Points
Sort
View
DCG
2010
104views more  DCG 2010»
14 years 6 months ago
Vietoris-Rips Complexes of Planar Point Sets
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
Erin W. Chambers, Vin de Silva, Jeff Erickson, Rob...
ESA
2001
Springer
97views Algorithms» more  ESA 2001»
15 years 1 months ago
Splitting a Delaunay Triangulation in Linear Time
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
Bernard Chazelle, Olivier Devillers, Ferran Hurtad...
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
15 years 4 months ago
On High Dimensional Projected Clustering of Uncertain Data Streams
— In this paper, we will study the problem of projected clustering of uncertain data streams. The use of uncertainty is especially important in the high dimensional scenario, bec...
Charu C. Aggarwal
BMVC
2002
14 years 12 months ago
Using Points at Infinity for Parameter Decoupling in Camera Calibration
We consider the problem of decoupling translation and rotation for a collection of 3D data related to 2D images by a projection. The main contribution is to show that equations de...
Jean-Yves Guillemaut, Alberto S. Aguado, John Illi...
MSR
2011
ACM
14 years 9 days ago
Security versus performance bugs: a case study on Firefox
A good understanding of the impact of different types of bugs on various project aspects is essential to improve software quality research and practice. For instance, we would ex...
Shahed Zaman, Bram Adams, Ahmed E. Hassan