604 search results - page 54 / 121 » The Hardness of Metric Labeling |
ASUNAM
2011
IEEE
12 years 8 months ago
2011
IEEE
Abstract—Community detection or cluster detection in networks is a well-studied, albeit hard, problem. Given the scale and complexity of modern day social networks, detecting “...
COMPSAC
2005
IEEE
14 years 1 months ago
2005
IEEE
Maintenance is a time consuming activity within software development and it requires a good understanding of the system in question. It is hard or even impossible to understand po...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
PPNA
2011
12 years 10 months ago
2011
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...