Sciweavers

2638 search results - page 6 / 528
» Random Geometric Complexes
Sort
View
DCG
2008
104views more  DCG 2008»
13 years 7 months ago
Finding the Homology of Submanifolds with High Confidence from Random Samples
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Partha Niyogi, Stephen Smale, Shmuel Weinberger
SCALESPACE
2007
Springer
14 years 1 months ago
Best Basis Compressed Sensing
This paper proposes an extension of compressed sensing that allows to express the sparsity prior in a dictionary of bases. This enables the use of the random sampling strategy of c...
Gabriel Peyré
CVPR
2010
IEEE
14 years 3 months ago
Segmentation of Building Facades Using Procedural Shape Priors
In this paper we propose a novel approach to the perceptual interpretation of building facades that combines shape grammars, supervised classification and random walks. Procedural...
Olivier Teboul, Loic Simon, Panagiotis Koutsouraki...
WG
1999
Springer
13 years 11 months ago
Linear Orderings of Random Geometric Graphs
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
Josep Díaz, Mathew D. Penrose, Jordi Petit,...
INFOCOM
2005
IEEE
14 years 20 days ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik