2498 search results - page 146 / 500 » Algorithms for the Topological Watershed |
195
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedro...
147
click to vote
INFOCOM
2007
IEEE
16 years 24 days ago
2007
IEEE
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
175
click to vote
SIBGRAPI
2005
IEEE
16 years 2 days ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
163
click to vote
WOWMOM
2005
ACM
16 years 1 days ago
2005
ACM
We propose in this paper reliable and precise distributed localization algorithms for wireless networks: iterative multidimensional scaling (IT-MDS) and simulated annealing multid...
161
click to vote
NPC
2005
Springer
15 years 12 months ago
2005
Springer
One major factor that heavily affects the performance of a content distribution network (CDN) is placement of the surrogates. Previous works take a network-centric approach and con...