Sciweavers

6 search results - page 1 / 2
» The Distribution of the Sample Minimum-Variance Frontier
Sort
View
CGI
2001
IEEE
13 years 9 months ago
Polygonizing Non-Uniformly Distributed 3D Points by Advancing Mesh Frontiers
30 digitization devices produce very large sets of 3 0 points sampled from the suqaces of the objects being scanned. A mesh construction procedure needs to be:upplied to derive po...
Indriyati Atmosukarto, Luping Zhou, Wee Kheng Leow...
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 6 months ago
Estimating and Sampling Graphs with Multidimensional Random Walks
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
Bruno F. Ribeiro, Donald F. Towsley
ICASSP
2010
IEEE
13 years 6 months ago
Distributed bearing estimation via matrix completion
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...
Andrew Waters, Volkan Cevher
ICPP
2006
IEEE
14 years 2 days ago
A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
Robert Niewiadomski, José Nelson Amaral, Ro...