[图书][B] Network analysis: methodological foundations
U Brandes - 2005 - books.google.com
'Network'is a heavily overloaded term, so that 'network analysis' means different things to
different people. Specific forms of network analysis are used in the study of diverse …
different people. Specific forms of network analysis are used in the study of diverse …
Theory of semidefinite programming for sensor network localization
We analyze the semidefinite programming (SDP) based model and method for the position
estimation problem in sensor network localization and other Euclidean distance geometry …
estimation problem in sensor network localization and other Euclidean distance geometry …
Further relaxations of the semidefinite programming approach to sensor network localization
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to
solve the sensor network localization problem. Although it achieves high accuracy in …
solve the sensor network localization problem. Although it achieves high accuracy in …
Virtual coordinates for ad hoc and sensor networks
T Moscibroda, R O'Dell, M Wattenhofer… - Proceedings of the …, 2004 - dl.acm.org
In many applications of wireless ad hoc and sensor networks, position-awareness is of great
importance. Often, as in the case of geometric routing, it is sufficient to have virtual …
importance. Often, as in the case of geometric routing, it is sufficient to have virtual …
Role assignments
J Lerner - Network analysis: Methodological foundations, 2005 - Springer
Classification is the key to understand large and complex systems that are made up of many
individual parts. For example in the study of food webs (networks that consist of living …
individual parts. For example in the study of food webs (networks that consist of living …
[PDF][PDF] Approximation algorithms for low-distortion embeddings into low-dimensional spaces
Approximation Algorithms for Low-Distortion Embeddings Into Low-Dimensional Spaces Page
1 Approximation Algorithms for Low-Distortion Embeddings Into Low-Dimensional Spaces …
1 Approximation Algorithms for Low-Distortion Embeddings Into Low-Dimensional Spaces …
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the
distances between each pair of points, up to a small factor called distortion. Low-distortion …
distances between each pair of points, up to a small factor called distortion. Low-distortion …
Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding,
parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal …
parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal …
[PDF][PDF] Further relaxations of the SDP approach to sensor network localization
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to
solve the sensor network localization problem. Although it achieves high accuracy in …
solve the sensor network localization problem. Although it achieves high accuracy in …
Dimensionality reduction: theoretical perspective on practical measures
Dimensionality reduction plays a central role in real-world applications for Machine
Learning, among many fields. In particular, metric dimensionality reduction where data from …
Learning, among many fields. In particular, metric dimensionality reduction where data from …