Sciweavers

470 search results - page 26 / 94
» Local properties of geometric graphs
Sort
View
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 3 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
AGTIVE
2003
Springer
14 years 1 months ago
Local Specification of Surface Subdivision Algorithms
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
Colin Smith, Przemyslaw Prusinkiewicz, Faramarz F....
SIAMJO
2010
87views more  SIAMJO 2010»
13 years 3 months ago
Universal Rigidity and Edge Sparsification for Sensor Network Localization
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye
ICS
2010
Tsinghua U.
14 years 6 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
WCNC
2010
IEEE
14 years 16 days ago
Node Connectivity Analysis in Multi-Hop Wireless Networks
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
Bahador Bakhshi, Siavash Khorsandi